之前陆陆续续地在leetcode以及剑指offer上刷了一些题目，有些题目回看已经忘了当初解体的思路，现在便开始记录一下每次解体的思路吧，方便复习。

剑指offer

SwordOffer文件夹是剑指offer书上题目Java版本的解答

3. 数组中的重复数字

   数组中的重复数字2

4. 二维数组中的查找

5. 替换空格

6. 从尾到头打印链表

7. 重建二叉树

8. 二叉树中序遍历的下一个节点

9. 两个栈实现队列

10. 斐波纳契数列

11. 旋转数组中最小数字

12. 矩阵中的路径

13. 机器人的运动范围

14. 剪绳子

15. 二进制中1的个数

16. 数值的整数次方

17. 打印从1到最大的n位十进制数

18. 删除链表的节点

    删除链表的重复节点

19. 正则表达式匹配

20. 表示数值的字符串

21. 调整数组的顺序使奇数位于偶数前面

22. 链表中倒数第k个结点

23. 链表中环的入口结点

24. 反转链表

25. 合并两个有序链表

LeetCode

• 1.Two_Sum
• 9.Palindrome_Number
• 13.Roman_to_Integer
• 21.Merge_Two_Sorted_Lists
• 26.Remove_Duplicates_from_Sorted_Array
• 27.Remove_Element_27
• 35.Search_Insert_Position
• 38.Count_and_Say
• 40.Combination Sum II
• 43.L43MultiplyStrings
• 46.Permutations
• 48.Rotate Image
• 53.Maximum_Subarray
• 54.L54SpiralMatrix
• 56.L56MergeIntervals
• 62.Unique_Paths
• 63.Unique_Paths2
• 66.PLUS_ONE
• 67.AddBinary
• 70.Climbing Stairs
• 75.L75SortColors
• 78.L78Subsets
• 79.L79WordSearch
• 88.Merge_Sorted_Array
• 91.Decode_Ways
• 94.Binary_Tree_Inorder_Traversal
• 104.MaximumDepth_of_Binary_Tree
• 118.L118PascalsTriangle
• 119.L119PascalsTriangleII
• 122.L122_Best_Time_to_Buy_and_Sell_StockII
• 123.L123_Best_Time_to_Buy_and_Sell_StockIII
• 136.Single_Number
• 189.RotateArray
• 198.House_Robber
• 205.Isomorphic_Strings
• 222.Count_Complete_Tree_Nodes
• 227.L227_Basic_CalculatorII
• 300.L300_Longest_Increasing_Subsequence
• 334.Reverse_String
• 338.Counting_Bits
• 395.Longest_Substring_with_At_Least_K_Repeating_Characters
• 406.L406_Queue_Reconstruction_by_Height
• 412.Fizz_Buzz
• 413.Arithmetic_Slices
• 416.L416_Partition_Equal_Subset_Sum
• 437.L437_Path_Sum_III
• 438.Find_All_Anagrams_in_a_String
• 448.L448_Find_All_Numbers_Disappeared_in_an_Array
• 454.4SumII
• 494.Target Sum
• 509.Fibonacci_Number
• 538.Convert_BST_to_Greater_Tree
• 543.Diameter_of_Binary_Tree
• 560.L560_Subarray_Sum_Equals_K
• 561.Array_Partition_1
• 581.Shortest_Unsorted_Continuous_Subarray
• 617.Merge_Two_Binary_Trees
• 621.Task Scheduler
• 647.Palindromic_Substrings
• 673.L673_Number_of_Longest_Increasing_Subsequence
• 680.L680_Valid_PalindromeII
• 712.Minimum_ASCII_Delete_Sum_for_Two_Strings
• 739.L739_Daily_Temperatures
• 746.Min_Cost_Climbing_Stairs
• 763.L763_Partition_Labels
• 771.Jewels_and_Stones
• 796.Rotate_String
• 832.Flipping an Image
• 867.Transpose_Matrix
• 868.Binary_Gap
• 872.Leaf_Similar_Trees
• 874.L874_Walking_Robot_Simulation
• 877.Stone_Game
• 892.Surface_Area_of_3D_Shapes
• 894.All_Possible_Full_Binary_Trees
• 905.Sort Array By Parity
• 922.Sort Array By Parity II
• 931.Minimum_Falling_Path_Sum
• 944.L944_Delete_Columns_to_Make_Sorted
• 950.Reveal_Cards_In_Increasing_Order
• 969.Pancake Sorting
• 977.Squares of a Sorted Array
• 999.Available_Captures_for_Rook
• 1025.Divisor_Game
• 1051.Height_Checker
• 1122.Relative_Sort_Array
• 1123.Lowest_Common_Ancestor_of_Deepest_Leaves
• 1169.L1169_InvalidTransactions
• 1365.L1365HowManyNumbersAreSmallerThantheCurrentNumber