• jiuzhang
  • 1 Introduction 【Python版162题】
  • 2 String字符串 【3题】
    • 2.1 StrStr_Sep30
    • 2.2 Reverse Words in a String_Sep30
    • 2.3 Rotate String_Oct01
  • 3 Binary Search二分查找【13题】
    • 3.1 Binary Search二分查找
    • 3.2 First Position of Target _Oct01
    • 3.3 Search for a Range搜索区间_Oct02
    • 3.4 Search Insert Position搜索插入位置_Oct02
    • 3.5 Search a 2D Matrix搜索二维矩阵_Oct03
    • 3.6 Search a 2D Matrix II搜索二维矩阵 II_Oct03
    • 3.7 First Bad Version第一个错误的代码版本_Oct04
    • 3.8 Find Peak Element寻找峰值_Oct04
    • 3.9 Median of two Sorted Arrays两个排序数组的中位数
    • 3.10 Search in Rotated Sorted Array搜索旋转排序数组
    • 3.11 Search in Rotated Sorted Array II搜索旋转排序数组 II
    • 3.12 Find Minimum in Rotated Sorted Array寻找旋转排序数组中的最小值
    • 3.13 Find Minimum in Rotated Sorted Array II寻找旋转排序数组中的最小值 II
  • 4 Binary Tree【13题】
    • 4.1 Subtree
    • 4.2 Binary Tree Preorder Traversal
    • 4.3 Binary Tree Postorder Traversal
    • 4.4 Binary Tree Inorder Traversal
    • 4.5 Maximum Depth of Binary Tree
    • 4.6 Minimum Depth of Binary Tree
    • 4.7 Balanced Binary Tree
    • 4.8 Binary Tree Maximum Path Sum
    • 4.9 Lowest Common Ancestor
    • 4.10 Binary Tree Level Order Traversal
    • 4.11 Binary Tree Level Order Traversal II
    • 4.12 Binary Tree Zigzag Level Order Traversal
    • 4.13 Construct Binary Tree from Preorder and Inorder Traversal
  • 5 Binary Search Tree【5题】
    • 5.1 Validate Binary Search Tree
    • 5.2 Insert Node in a Binary Search Tree
    • 5.3 Search Range in Binary Search Tree
    • 5.4 Remove Node in Binary Search Tree
    • 5.5 Binary Search Tree Iterator
  • 6 Linked List 【17题】
    • 6.1 Remove Linked List Elements
    • 6.2 Delete Node in the Middle of Singly Linked List
    • 6.3 Remove Duplicates from Sorted List
    • 6.4 Remove Duplicates from Sorted List II
    • 6.5 Merge Two Sorted Lists
    • 6.6 Add Two Numbers
    • 6.7 Reverse Linked List
    • 6.8 Reverse Linked List II
    • 6.9 Partition List
    • 6.10 Sort List
    • 6.11 Reorder List
    • 6.12 Linked List Cycle
    • 6.13 Linked List Cycle II
    • 6.14 Intersection of Two Linked Lists
    • 6.15 Merge k Sorted Lists
    • 6.16 Copy List with Random Pointer
    • 6.17 Convert Sorted List to Balanced BST
  • 7 Dynamic Programming 【41题】
    • 7.1 Triangle
    • 7.2 Minimum Path Sum
    • 7.3 Unique Paths
    • 7.4 Unique Paths II
    • 7.5 Climbing Stairs
    • 7.6 Jump Game
    • 7.7 Jump Game II
    • 7.8 Palindrome Partitioning II
    • 7.9 Word Break
    • 7.10 Longest Common Subsequence
    • 7.11 Longest Common Substring
    • 7.12 Longest Increasing Continuous Subsequence
    • 7.13 Longest Increasing Subsequence
    • 7.14 Edit Distance
    • 7.15 Distinct Subsequences
    • 7.16 Interleaving String
    • 7.17 House Robber
    • 7.18 House Robber II
    • 7.19 Maximal Square
    • 7.20 Backpack
    • 7.21 Backpack II
    • 7.22 Backpack III
    • 7.23 Backpack IV
    • 7.24 Backpack V
    • 7.25 Backpack VI
    • 7.26 k Sum
    • 7.27 Minimum Adjustment Cost
    • 7.28 Maximum Subarray
    • 7.29 Maximum Subarray II
    • 7.30 Maximum Subarray III
    • 7.31 Maximum Product Subarray
    • 7.32 Best Time to Buy and Sell Stock
    • 7.33 Best Time to Buy and Sell Stock II
    • 7.34 Best Time to Buy and Sell Stock III
    • 7.35 Best Time to Buy and Sell Stock IV
    • 7.36 Longest Increasing Continuous subsequence II
    • 7.37 Coins in a Line
    • 7.38 Coins in a Line II
    • 7.39 Coins in a Line III
    • 7.40 Stone Game
    • 7.41 Scramble String
  • 8 Data Structure 【12题】
    • 8.1 Min Stack
    • 8.2 Implement Queue by Two Stacks
    • 8.3 Largest Rectangle in Histogram
    • 8.4 Max Tree
    • 8.5 Rehashing
    • 8.6 LRU Cache
    • 8.7 Data Stream Median
    • 8.8 Longest Consecutive Sequence
    • 8.9 Subarray Sum
    • 8.10 Anagrams
    • 8.11 Heapify
    • 8.12 Word Search II
  • 9 Math and Bit Manipulation 【13题】
    • 9.1 Single Number
    • 9.2 Single Number II
    • 9.3 Single Number III
    • 9.4 Majority Number
    • 9.5 Majority Number II
    • 9.6 Majority Number III
    • 9.7 Fast Power
    • 9.8 Sqrt(x)
    • 9.9 Trailing Zeros
    • 9.10 O(1) Check Power of 2
    • 9.11 Digit Counts
    • 9.12 Ugly Number II
    • 9.13 Count 1 in Binary
  • 10 Array 【16题】
    • 10.1 Quick Sort
    • 10.2 Merge Sort 没有
    • 10.3 Reverse Pairs
    • 10.4 Merge Sorted Array
    • 10.5 Merge Two Sorted Arrays
    • 10.6 Recover Rotated Sorted Array
    • 10.7 Remove Duplicates from Sorted Array
    • 10.8 Remove Duplicates from Sorted Array II
    • 10.9 Minimum Subarray
    • 10.10 Maximum Subarray Difference
    • 10.11 Subarray Sum Closest
    • 10.12 Median
    • 10.13 Kth Largest Element
    • 10.14 Kth Smallest Number in Sorted Matrix
    • 10.15 Kth Largest in N Arrays
    • 10.16 Spiral Matrix II
  • 11 Two Pointers 【11题】
    • 11.1 Partition Array
    • 11.2 Two Sum
    • 11.3 3 Sum
    • 11.4 3 Sum Closest
    • 11.5 4 Sum
    • 11.6 Two Sum II
    • 11.7 Triangle Count
    • 11.8 Sort Letters by Case
    • 11.9 Sort Colors
    • 11.10 Triangle Count没有
    • 11.11 Longest Substring Without Repeating Characters
  • 12 Graph 【2题】
    • 12.1 Clone Graph
    • 12.2 Topological Sorting
  • 13 Search 【15题】
    • 13.1 Subsets
    • 13.2 Subsets II
    • 13.3 Permutations
    • 13.4 Permutations II
    • 13.5 Binary Tree Path Sum
    • 13.6 N-Queens
    • 13.7 N-Queens II
    • 13.8 Palindrome Partitioning
    • 13.9 Combinations
    • 13.10 Combination Sum
    • 13.11 Combination Sum II
    • 13.12 Combination Sum III
    • 13.13 Letter Combinations of a Phone Number
    • 13.14 Word Ladder
    • 13.15 Binary Tree Path Sum
Powered by GitBook

1 Introduction 【Python版162题】

可以参考

https://pobenliu.gitbooks.io/leetcode/content/strStr.html。和本文相同。

也可以参考http://www.code123.cc/docs/leetcode-notes/basics\_data\_structure/linked\_list.html，这个和本文不同。

results matching ""

    No results matching ""