Given a linked list, reverse the nodes of a linked listkat a time and return its modified list.If the number of nodes is not a multiple ofkthen left-o...
分类：
其他好文 时间：
2014-11-17 13:56:54
阅读次数：
182
题目描述：
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).
For example:
Given binary tree {3,9,20,#,#,15,7},
3
/ ...
分类：
其他好文 时间：
2014-11-17 12:26:22
阅读次数：
171
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 itto {1,4,...
分类：
其他好文 时间：
2014-11-17 10:45:06
阅读次数：
179
Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next level and al...
分类：
其他好文 时间：
2014-11-16 18:36:32
阅读次数：
232
Given a singly linked listL: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 exam...
分类：
其他好文 时间：
2014-11-16 18:33:18
阅读次数：
200
Given a linked list, swap every two adjacent nodes and return its head.For example,Given1->2->3->4, you should return the list as2->1->4->3.Your algor...
分类：
其他好文 时间：
2014-11-16 15:57:02
阅读次数：
131
对于任一位向量a，有a ^ a = 0。考虑下面的程序：1 void inplace_swap(int *x, int *y)2 {3 *y = *x ^ *y;4 *x = *x ^ *y;5 *y = *x ^ *y;6 }假设x和y指向的位置分别是a和b。完成下表：步骤...
分类：
移动开发 时间：
2014-11-16 15:54:44
阅读次数：
271
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ...
分类：
其他好文 时间：
2014-11-16 15:52:15
阅读次数：
226
Given a singly linked listL: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 exam...
分类：
其他好文 时间：
2014-11-16 14:41:01
阅读次数：
280
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single ...
分类：
其他好文 时间：
2014-11-16 14:36:42
阅读次数：
140
