题目描述：
Reverse a linked list from position m to n. Do it in-place and in one-pass.
For example:
Given 1->2->3->4->5->NULL, m = 2 and n = 4,
return 1->4->3->2->5->NULL.
Note:
Given m, n satisfy the following condition:
1 ≤ m ≤ n ...
类别归档：LeetCode
LeetCode OJ is a platform for preparing technical coding interviews.
[LeetCode]Reverse Linked List II
[LeetCode]Reorder List
作者是
发布于
在
LeetCode.
题目描述：
Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…
You must do this in-place without altering the nodes' values.
For example,
Given {1,2,3,4}, reorder it to {1,4,2,3}.
题目大意：
给定一个单链表L：L0→L1→…→Ln-1→Ln
重新将其排序为 ...
[LeetCode]Binary Tree Preorder Traversal
作者是
发布于
在
LeetCode.
题目描述：
Given a binary tree, return the preorder traversal of its nodes' values.
For example:
Given binary tree {1,#,2,3},
1
\
2
/
3
return [1,2,3].
题目大意：
给定一棵二叉树，返回节点值的先序遍历结果（尽量使用非递归算法）。
解题思路：
使用数据结构栈（Stack）
先序遍历非递归算法的伪代码如下（摘自Wikipedia）：
iterativePreorder(node)
parentStack ...
[LeetCode]Department Top Three Salaries
作者是
发布于
在
LeetCode.
题目描述：
The Employee table holds all employees. Every employee has an Id, and there is also a column for the department Id.
+----+-------+--------+--------------+ | Id | Name | Salary | DepartmentId | +----+-------+--------+--------------+ | 1 | Joe | 70000 | 1 | | 2 | Henry | 80000 | 2 | | 3 | Sam | 60000 | 2 | | 4 | Max ...
[LeetCode]Department Highest Salary
作者是
发布于
在
LeetCode.
题目描述：
The Employee table holds all employees. Every employee has an Id, a salary, and there is also a column for the department Id.
+----+-------+--------+--------------+ | Id | Name | Salary | DepartmentId | +----+-------+--------+--------------+ | 1 | Joe | 70000 | 1 | | 2 | Henry | 80000 | 2 | | 3 | Sam | 60000 | 2 ...