- 博客(2)
- 收藏
- 关注
原创 leetcode sqrt(x)
Implement int sqrt(int x). Compute and return the square root of x. int sqrt(int x) { int i; if (x == 0) return 0; if (x == 1 || x == 2 || x == 3) return 1; if (x <= 10000000
2014-11-25 21:45:58 1067
原创 leetcode-Linked List
Linked List Cycle Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space?
2014-11-17 20:10:33 554
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人