First, the bit operation
The number of binary 1 --15 https://blog.csdn.net/qq_22527013/article/details/88729605
Do not do addition and subtraction, multiplication and division - 65 https://blog.csdn.net/qq_22527013/article/details/91413669
LeetCode 371. Sum of Two Integers (binary addition with) - https://blog.csdn.net/qq_22527013/article/details/92609495
Second, the binary tree
Reconstruction of binary - 7 ì https://blog.csdn.net/qq_22527013/article/details/88350788
LeetCode 108. Convert Sorted Array to Binary Search Tree ( sorted array constructed binary search tree) - https://blog.csdn.net/qq_22527013/article/details/91974763
The next node in the binary tree -. 8 https://blog.csdn.net/qq_22527013/article/details/88390325
Sub-tree - 26 https://blog.csdn.net/qq_22527013/article/details/89468523
Binary Tree Mirror - 27 https://blog.csdn.net/qq_22527013/article/details/89640140
LeetCode 101. Symmetric Tree —— https://blog.csdn.net/qq_22527013/article/details/91873430
Symmetrical binary - 28 https://blog.csdn.net/qq_22527013/article/details/89640697
Print Binary Tree - 32 https://blog.csdn.net/qq_22527013/article/details/89848135
After the binary search elements sequence preorder traversal of tree - 33 is https://blog.csdn.net/qq_22527013/article/details/89881687
Path for a binary tree and value - 34 is https://blog.csdn.net/qq_22527013/article/details/89885408
Binary search trees and doubly-linked list - 36 https://blog.csdn.net/qq_22527013/article/details/89922068
Binary Serialization - 37 [ https://blog.csdn.net/qq_22527013/article/details/90175201
Median data stream - 41 is https://blog.csdn.net/qq_22527013/article/details/90443673
Binary search tree node k-th - 54 is https://blog.csdn.net/qq_22527013/article/details/90764714
Binary tree of depth - 55 https://blog.csdn.net/qq_22527013/article/details/90767878
Balanced binary tree - 55 https://blog.csdn.net/qq_22527013/article/details/90767878
Third, the string
Replace spaces - 5 https://blog.csdn.net/qq_22527013/article/details/88317965
Regular expression matching - 19 https://blog.csdn.net/qq_22527013/article/details/91573270
String a numerical value - 20 is https://blog.csdn.net/qq_22527013/article/details/89214223
The arrangement of the string - 38 is https://blog.csdn.net/qq_22527013/article/details/90175376
Digital translated into strings - 46 is https://blog.csdn.net/qq_22527013/article/details/90601503
No repeating longest substring of characters - 48 https://blog.csdn.net/qq_22527013/article/details/90666347
50-- first time the character appears only https://blog.csdn.net/qq_22527013/article/details/90679476
LeetCode 387. First Unique Character in a String —— https://blog.csdn.net/qq_22527013/article/details/92607708
A first character stream not repeated character - 50 https://blog.csdn.net/qq_22527013/article/details/90679476
Flip string - 58 https://blog.csdn.net/qq_22527013/article/details/91371032
Left rotation strings - 58 https://blog.csdn.net/qq_22527013/article/details/91371032
The string into an integer - https://blog.csdn.net/qq_22527013/article/details/91562533
LeetCode 242. Valid Anagram (isobaric with picture) - https://blog.csdn.net/qq_22527013/article/details/89162954
LeetCode 38. Count and Say (description string and counting) - https://blog.csdn.net/qq_22527013/article/details/89179175
LeetCode 125. Valid Palindrome (Analyzing string palindrome) - https://blog.csdn.net/qq_22527013/article/details/92429293
Fourth, the array
Array duplicate numbers -. 3 https://blog.csdn.net/qq_22527013/article/details/88235419
Find a two-dimensional array - 4 https://blog.csdn.net/qq_22527013/article/details/88314162
Minimum number of rotation of the array --11 https://blog.csdn.net/qq_22527013/article/details/88558963
Adjust the order of the array so that in front of the even-odd - 21 is https://blog.csdn.net/qq_22527013/article/details/89240880
More than half of the number of digital - 39 https://blog.csdn.net/qq_22527013/article/details/90209290
And the maximum continuous subarray - 42 is https://blog.csdn.net/qq_22527013/article/details/90477241
LeetCode 53. Maximum Subarray —— https://blog.csdn.net/qq_22527013/article/details/89676056
A digital bit sequence of numbers - 44 https://blog.csdn.net/qq_22527013/article/details/90575194
Array appears once the array arranged in the smallest number - 45 https://blog.csdn.net/qq_22527013/article/details/90576891
Reverse in the array - 51 is https://blog.csdn.net/qq_22527013/article/details/90692683
The number of times the number that appears in the sort array - 53 https://blog.csdn.net/qq_22527013/article/details/90760019
Number that appears in the array times - 56 is https://blog.csdn.net/qq_22527013/article/details/90897147
LeetCode 136. Single Number —— https://blog.csdn.net/qq_22527013/article/details/92434651
And two of the number S - 57 is https://blog.csdn.net/qq_22527013/article/details/90899383
And a continuous positive sequence S - 57 is https://blog.csdn.net/qq_22527013/article/details/90899383
The maximum profit shares - 63 https://blog.csdn.net/qq_22527013/article/details/91400294
LeetCode 121. Best Time to Buy and Sell Stock —— https://blog.csdn.net/qq_22527013/article/details/91400294
Building product array - 66 https://blog.csdn.net/qq_22527013/article/details/91415458
LeetCode 66. Plus One (to the array described in the +1 and converted into the number of arrays) - https://blog.csdn.net/qq_22527013/article/details/89677364
LeetCode 88. Merge Sorted Array (Merge sort array) - https://blog.csdn.net/qq_22527013/article/details/91869060
LeetCode 118. Pascal's Triangle (Pascal's Triangle) - https://blog.csdn.net/qq_22527013/article/details/92396273
LeetCode 350. Intersection of Two Arrays II (and set arrays) - https://blog.csdn.net/qq_22527013/article/details/92617785
V. Other
Fibonacci columns --10 https://blog.csdn.net/qq_22527013/article/details/88415689
LeetCode 70. Climbing Stairs —— https://blog.csdn.net/qq_22527013/article/details/91867477
A rectangular footprint --10 https://blog.csdn.net/qq_22527013/article/details/88415689
Jump stairs - 10 https://blog.csdn.net/qq_22527013/article/details/88415689
Abnormal jump stairs --10 https://blog.csdn.net/qq_22527013/article/details/88415689
Cut the rope --14 https://blog.csdn.net/qq_22527013/article/details/88726455
Integer power value - 16 https://blog.csdn.net/qq_22527013/article/details/88808199
Printing from 1 to the maximum number of bits n -. 17 https://blog.csdn.net/qq_22527013/article/details/89151005
The number of occurrences of integers from 1 to n in the 1 - 43 is https://blog.csdn.net/qq_22527013/article/details/90483820
Ugly number - 49 https://blog.csdn.net/qq_22527013/article/details/90678391
of n dice - 60 https://blog.csdn.net/qq_22527013/article/details/91382704
Poker Straight - 61 https://blog.csdn.net/qq_22527013/article/details/91396917
The remaining number of circle - 62 https://blog.csdn.net/qq_22527013/article/details/91398403
Seeking. 3 + 2 + +. 1 ... + n---64 https://blog.csdn.net/qq_22527013/article/details/91401126
LeetCode 69. Sqrt(x) —— https://blog.csdn.net/qq_22527013/article/details/91856138
LeetCode 412. Fizz Buzz —— https://blog.csdn.net/qq_22527013/article/details/92602463
6.0 Matrix
Clockwise print matrix - 29 https://blog.csdn.net/qq_22527013/article/details/89641098
The maximum value of the gift - 47 https://blog.csdn.net/qq_22527013/article/details/90639806
Seven heap
The minimum number k - 40 https://blog.csdn.net/qq_22527013/article/details/90246965
Eight, stacks and queues
Queue with two stacks -. 9 https://blog.csdn.net/qq_22527013/article/details/88404687
Function stack contains min - 30 https://blog.csdn.net/qq_22527013/article/details/89739627
Stack push, pop sequence - 31 is https://blog.csdn.net/qq_22527013/article/details/89844375
Sliding window maximum - 59 https://blog.csdn.net/qq_22527013/article/details/91373331
Queue maximum - 59 https://blog.csdn.net/qq_22527013/article/details/91373331
Nine, backtracking
Path matrix --12 https://blog.csdn.net/qq_22527013/article/details/88560328
Robot range of motion - 13 https://blog.csdn.net/qq_22527013/article/details/88568498
X. list
List print head from the tail -. 6 https://blog.csdn.net/qq_22527013/article/details/88339521
Delete the list of nodes - 18 https://blog.csdn.net/qq_22527013/article/details/89174976
LeetCode 237. Delete Node in a Linked List —— 18 https://blog.csdn.net/qq_22527013/article/details/89162862
Reciprocal of the k-th node in the list - 22 is https://blog.csdn.net/qq_22527013/article/details/89315197
Central node list entry - 23 is https://blog.csdn.net/qq_22527013/article/details/89316819
Reverse list - 24- https://blog.csdn.net/qq_22527013/article/details/89466150
Merge two sorted lists - 25 https://blog.csdn.net/qq_22527013/article/details/89467049
Complex chain of copy - 35 https://blog.csdn.net/qq_22527013/article/details/89920750
A first common node of the two lists - 52 is https://blog.csdn.net/qq_22527013/article/details/90697784
List palindrome - https://blog.csdn.net/qq_22527013/article/details/89150545