首页 > 学院 > 开发设计 > 正文

leetcode 渣渣刷题目录

2019-11-06 06:09:21
字体:
来源:转载
供稿:网友

数组

* Remove Duplicates from Sorted Array* Remove Duplicates from Sorted Array II* Search in Rotated Sorted Array* Search in Rotated Sorted Array II* Median of Two Sorted Arrays* Longest Consecutive Sequence* Two Sum* 3Sum* 3Sum Closest* 4Sum* Remove Element* Next Permutation* Permutation Sequence* Valid Sudoku* Trapping Rain Water* Rotate Image* Plus One* Climbing Stairs* Gray Code* Set Matrix Zeroes* Gas Station* Candy* Single Number* Single Number II

链表

* Add Two Numbers* Reverse Linked List II* Partition List* Remove Duplicates from Sorted List* Remove Duplicates from Sorted List II* Rotate List* Remove Nth Node From End of List* Swap Nodes in Pairs* Reverse Nodes in k-Group* Copy List with Random Pointer* Linked List Cycle* Linked List Cycle II* Reorder List* LRU Cache

字符串

* Valid Palindrome* Implement strStr()* String to Integer (atoi)* Add Binary* Longest Palindromic Substring* Regular ExPRession Matching* Wildcard Matching* Longest Common Prefix* Integer to Roman* Roman to Integer* Count and Say* Anagrams* find all Anagrams* Simplify Path* Length of Last Word

* Valid Parentheses* Generate Parentheses* Longest Valid Parentheses* Largest Rectangle in Histogram* Evaluate Reverse Polish Notation

二叉树

* Binary Tree Preorder Traversal* Binary Tree Inorder Traversal* Binary Tree Postorder Traversal* Binary Tree Level Order Traversal* Binary Tree Level Order Traversal II* Binary Tree Zigzag Level Order Traversal* Recover Binary Search Tree* Same Tree* Symmetric Tree* Balanced Binary Tree* Flatten Binary Tree to Linked List* Populating Next Right Pointers in Each Node* Populating Next Right Pointers in Each Node II* Construct Binary Tree from Preorder and Inorder Traversal* Construct Binary Tree from Inorder and Postorder Traversal* Unique Binary Search Trees* Unique Binary Search Trees II* Validate Binary Search Tree* Convert Sorted Array to Binary Search Tree* Convert Sorted List to Binary Search Tree* Minimum Depth of Binary Tree* Maximum Depth of Binary Tree* Path Sum* Path Sum II* Binary Tree Maximum Path Sum* Sum Root to Leaf Numbers

排序

* Merge Sorted Array* Merge Two Sorted Lists* Merge k Sorted Lists* Insertion Sort List* Sort List* First Missing Positive* Sort Colors

查找

* Search for a Range* Search Insert Position* Search a 2D Matrix

暴力枚举

* Subsets* Subsets II* Permutations* Permutations II* Combinations* Letter Combinations of a Phone Number

BFS

* Word Ladder* Word Ladder II* Surrounded Regions

DFS

* Palindrome Partitioning* Unique Paths* Unique Paths II* N-Queens* N-Queens II* Restore ip Addresses* Combination Sum* Combination Sum II* 3,4* Generate Parentheses* Sudoku Solver* Word Search

分治

* Pow(x, n)* Sqrt(x)

贪心

* Jump Game* Jump Game II* Best Time to Buy and Sell Stock* Best Time to Buy and Sell Stock II* Longest Substring Without Repeating Characters* Container With Most Water

动态规划

* Triangle* Maximum Subarray* Palindrome Partitioning II* Maximal Rectangle* Best Time to Buy and Sell Stock III* Interleaving String* Scramble String* Minimum Path Sum* Edit Distance* Decode Ways* Distinct Subsequences* Word Break* Word Break II

* Clone Graph

模拟

* Reverse Integer* Palindrome Number* Insert Interval* Merge Intervals* Minimum Window Substring* Multiply Strings* Substring with Concatenation of All Words* Pascal’s Triangle Pascal’s Triangle II* Spiral Matrix* Spiral Matrix II* ZigZag Conversion* Divide Two Integers* Text Justification* Max Points on a Line
发表评论 共有条评论
用户名: 密码:
验证码: 匿名发表