u014168855的博客

数组1. Two Sum15. 3Sum16. 3Sum Closest18. 4Sum26. Remove Duplicates from Sorted Array27. Remove Element41. First Missing Positive48. Rotate Image54. Spiral Matrix59. Spiral Matrix II56. Merge Intervals57. Insert Interval55. Jump Game66. Plus One73. Set Matri

堆23. Merge k Sorted Lists215. Kth Largest Element in an Array264. Ugly Number II347. Top K Frequent Elements23. Merge k Sorted ListsMerge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity.Example:Input:[ 1

leetocde-栈20. Valid Parentheses42. Trapping Rain Water71. Simplify Path84. Largest Rectangle in Histogram85. Maximal Rectangle150. Evaluate Reverse Polish Notation155. Min Stack224. Basic Calculator225. Implement Stack using Queues232. Implement Queue usin

树94. Binary Tree Inorder Traversal95. Unique Binary Search Trees II96. Unique Binary Search Trees98. Validate Binary Search Tree99. Recover Binary Search Tree100. Same Tree101. Symmetric Tree102. Binary Tree Level Order Traversal103. Binary Tree Zigzag Lev

leetcode-链表

二分搜索：背景：本人最近开始刷leetcode，已经按顺序刷完leetcode前200道题目，现在进行二刷，分类进行刷前200道题目，本次分享二分搜索，二分搜索题目的难度大部分medium难度。二分搜索4. Median of Two Sorted Arrays4. Median of Two Sorted Arrays...

背景：本人最近开始刷leetcode，已经按顺序刷完leetcode前200道题目，现在进行二刷，分类进行刷前200道题目，本次分享深度优先（Depth First Search），深度优先题目的难度大部分medium难度，数据结构分别为树，数组和图。深度优先1.树98. Validate Binary Search Tree99. Recover Binary Search Tree100. ...

背景：本人最近开始刷leetcode，已经按顺序刷完leetcode前200道题目，现在进行二刷，分类进行刷前200道题目，本次分享动态规划（Dynamic Programming），动态规划题目的难度大部分medium难度和hard，题目类型分为一维动态规划和二维动态规划，下面分类进行介绍。动态规划1.一维动态规划2.二维动态规划1.一维动态规划2.二维动态规划...

背景：本人最近开始刷leetcode，已经按顺序刷完leetcode前200道题目，现在进行二刷，分类进行刷前200道题目，本次分享回溯法（backtraking），回溯法题目的难度大部分是中等难度，涉及到的数据结构包括数组（一维和二维），字符串等，下面分类进行介绍。1.一维数组2.二维数组3.字符串...