Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.
For example,
Given n = 3,
You should return the following matrix:
[
[ 1, 2, 3 ],
[ 8, 9, 4 ],
[...
分类：
其他好文 时间：
2015-01-12 14:42:40
阅读次数：
222
废话不多说，这是地址：http://android.lineten.net/layout.php。有图有真相，比如：你的XML假如是这样： 生成代码例如以下： // Content View Elements private ImageView mLogo; private...
分类：
移动开发 时间：
2015-01-12 11:30:48
阅读次数：
205
题目：Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.代码：oj测试通过Runtime:178 ms 1 # Definition...
分类：
编程语言 时间：
2015-01-11 20:18:51
阅读次数：
235
Given an array and a value, remove all instances of that value in place and return the new length.
The order of elements can be changed. It doesn't matter what you leave beyond the new length.
c...
分类：
其他好文 时间：
2015-01-11 14:51:23
阅读次数：
122
Convert Sorted List to Binary Search TreeGiven a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST....
分类：
其他好文 时间：
2015-01-11 14:46:32
阅读次数：
160
Convert Sorted Array to Binary Search TreeGiven an array where elements are sorted in ascending order, convert it to a height balanced BST.每次把中间元素当成根节...
分类：
其他好文 时间：
2015-01-11 12:10:19
阅读次数：
137
一 ArrayList
1. arraylist里面是通过数组实现的
/**
* The array buffer into which the elements of the ArrayList are stored.
* The capacity of the ArrayList is the length of this array buffer...
分类：
编程语言 时间：
2015-01-10 12:42:15
阅读次数：
172
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST....
分类：
其他好文 时间：
2015-01-09 22:29:55
阅读次数：
181
Given an unsorted array of integers, find the length of the longest consecutive elements sequence. For example,Given [100, 4, 200, 1, 3, 2],The longes...
分类：
其他好文 时间：
2015-01-09 22:08:16
阅读次数：
178
Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d =
target? Find all unique quadruplets in the array which gives the sum of target.
Note:
Element...
分类：
其他好文 时间：
2015-01-09 09:17:54
阅读次数：
180
