- 博客(10)
- 资源 (40)
- 收藏
- 关注
原创 LeetCode:Counting Bits
Counting Bits Total Accepted: 18290 Total Submissions: 32984 Difficulty: MediumGiven a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the
2016-04-29 17:34:09 4568
原创 KMP算法
KMP算法1.首先是next数组求法void getNext(char *p, int *next){ int pLen = strlen(p); int k = -1; int j = 0; next[0] = -1; while (j < pLen) { if (k == -1 || p[k] == p[j]) { k++; j
2016-04-19 11:20:11 534
原创 LeetCode:Merge k Sorted Lists
Merge k Sorted ListsTotal Accepted: 82424 Total Submissions: 354076 Difficulty: HardMerge k sorted linked lists and return it as one sorted list. Analyze and describe its complexit
2016-04-16 13:26:01 3195
原创 LeetCode:Reverse Nodes in k-Group
Reverse Nodes in k-Group Total Accepted: 57696 Total Submissions: 210241 Difficulty: HardGiven a linked list, reverse the nodes of a linked list k at a time and return its modified
2016-04-16 13:02:34 2956
原创 LeetCode:Partition List
Partition List Total Accepted: 63877 Total Submissions: 217363 Difficulty: MediumGiven a linked list and a value x, partition it such that all nodes less than x come before nod
2016-04-16 12:11:18 2775
原创 LeetCode:Convert Sorted List to Binary Search Tree
Convert Sorted List to Binary Search TreeTotal Accepted: 67959 Total Submissions: 224265 Difficulty: MediumGiven a singly linked list where elements are sorted in ascending order, conv
2016-04-14 16:36:26 1110
原创 LeetCode:Sort List
Sort ListTotal Accepted: 68684 Total Submissions: 278057 Difficulty: MediumSort a linked list in O(n log n) time using constant space complexity.Subscribe to see whic
2016-04-14 16:02:47 696
原创 LeetCode:Add Two Numbers
Add Two NumbersTotal Accepted: 135836 Total Submissions: 594520 Difficulty: MediumYou are given two linked lists representing two non-negative numbers. The digits are sto
2016-04-14 14:54:47 763
原创 LeetCode:Rotate List
Rotate ListTotal Accepted: 66597 Total Submissions: 291807 Difficulty: MediumGiven a list, rotate the list to the right by k places, where k is non-negative.For example:Given 1
2016-04-14 14:33:02 618
原创 Java中四种引用(强、软、弱、虚)
Java中四种引用(强、软、弱、虚)1.强引用(StrongReference) 强引用是使用最普遍的引用。如果一个对象具有强引用,那垃圾回收器绝不会回收它。当内存空间不足,Java虚拟机宁愿抛出OutOfMemoryError错误,使程序异常终止,也不会靠随意回收具有强引用的对象来解决内存不足的问题。2.软引用(SoftRefere
2016-04-03 10:31:21 657
WebGL编程指南 [KouichiMatsuda著;RodgerLea著;谢光磊][电子工业出版社][2014.06][470页]
2015-12-28
《OpenGL ES 2.0 开发向导》源码
2018-12-28
Android 开发艺术探索高清完整版(电子版)
2018-08-22
FFmpeg4Android:视频文件推流
2018-03-30
程序员接单宝典_第3版_韦刃著
2016-01-05
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人