LeetCode Solution
# | Title | Solution | Tag | Difficulty |
---|---|---|---|---|
:-- | :---------------------------------------------: | :--: | :------------------- | :---: |
---- | ----------------------------------------------- | ---- | -------------------- | ----- |
0005 | Longest Palindromic Substring(最长回文子串) | C++ | String DP | Medium |
0021 | Merge Two Sorted Lists(合并两个有序链表) | C++ | Linked List | Easy |
0046 | Permutations(全排列) | C++ | Back Tracking | Medium |
0078 | Edit Distance(编辑距离) | C++ | String DP | Hard |
0088 | Merge Sorted Array(合并两个有序数组) | C++ | Array Two Pointers | Easy |
0102 | Binary Tree Level Order Traversalon1(二叉树的层序遍历) | C++ | Tree BFS | Medium |
0206 | Reverse Linked List(反转链表) | C++ | Tree | Easy |
0234 | Palindrome Linked List(回文链表) | C++ | Linked_List Two_Pointers | Easy |
0236 | Lowest Common Ancestor of a Binary Tree(最小公共祖先) | C++ | Tree | Medium |
0238 | Product of Array Except Self(其他元素的乘积) | C++ | Array | Medium |
0240 | Search a 2D Matrix II(有序矩阵找数) | C++ | Binary_Search Divide_and_Conque | Medium |
0279 | Perfect Squares(和为目标的平方数的最少数目) | C++ | Math DP BFS | Medium |
0283 | Move Zeroes(移零到末尾) | C++ | Array Two_Pointers | Easy |
0287 | Find the Duplicate Number(找出重复数字(数字在1-n之间)) | C++ | Array Two_Pointers Binary_Search | Medium |
0300 | Longest Increasing Subsequence(最长递增子序列) | C++ | Binary_Search DP | Medium |
0315 | Count of Smaller Numbers After Self(计算数组右边比当前数据小的数) | C++ | Binary Search Divide and Conquer Sort Binary Indexed Tree Segment Tree | Hard |
0322 | Coin Change(换零钱可能失败) | C++ | DP | Medium |
0337 | House Robber(不能抢劫相邻的二叉树节点) | C++ | Tree DPS | Medium |
0347 | Top K Frequent Elements(出现次数最多的k个元素) | C++ | Hash_Table Heap | Medium |
0406 | Queue Reconstruction by Height(重排队列) | C++ | Greedy | Medium |
0416 | Partition Equal Subset Sum(平分数组) | C++ | DP | Medium |
0437 | Path Sum III(和为指定值的路径数目) | C++ | Tree | Easy |
0438 | Find All Anagrams in a String(找出所有异序次出现位置) | C++ | Hash Table | Easy |
0438 | Daily Temperatures(下一个温暖的日子还有几天) | C++ | Hash Table Stack | Medium |