ID | Problem | Solution(javascript) |
---|---|---|
面试题01.07 | rotate-matrix-lcci(旋转矩阵) | solution |
面试题01.08 | zero-matrix-lcci(零矩阵) | solution |
001 | twoSum(两数之和) | solution |
003 | longest-substring-without-repeating-characters(无重复字符的最长子串) | solution |
005 | longest-palindromic-substring(最长回文子串) | solution |
010 | regular-expression-matching(正则表达式匹配)-hard | solution |
015 | 3sum(三数之和)-middle | solution |
018 | 4sum(四数之和)-middle | solution |
019 | remove-nth-node-from-end-of-list(删除链表的倒数第N个节点) | solution |
020 | Valid Parentheses(有效的括号) | solution |
021 | Merge Two Sorted Lists(合并两个有序链表) | solution |
022 | generate-parentheses(括号生成)-medium | solution |
024 | swap-nodes-in-pairs(两两交换链表中的节点)-middile | solution |
025 | reverse-nodes-in-k-group(K个一组翻转链表)-hard | solution |
026 | Remove Duplicates from Sorted Array(删除排序数组中的重复项) | solution |
027 | Remove Element(移除元素) | solution |
028 | implement-strstr(实现 strStr() ) | solution |
035 | search-insert-position(搜索插入位置) | solution |
042 | trapping-rain-water(接雨水) | solution |
046 | permutations(全排列)-medium | solution |
050 | powx-n(Pow(x, n)) | solution |
053 | maximum-subarray(最大子序和) | solution |
055 | jump-game(跳跃游戏) | solution |
056 | merge-intervals(合并区间) | solution |
058 | length-of-last-word(最后一个单词的长度) | solution |
066 | plus-one(加一) | solution |
067 | add-binary(二进制求和) | solution |
070 | 70-climbing-stairs(爬楼梯) | solution |
072 | edit-distance(编辑距离)-hard | solution |
076 | minimum-window-substring(最小覆盖字符串) | solution |
077 | combinations(组合)-medium | solution |
078 | subsets(子集) | solution |
083 | remove-duplicates-from-sorted-list(删除排序链表中的重复元素) | solution |
092 | reverse-linked-list-ii(反转链表2) | solution |
094 | binary-tree-inorder-traversal(二叉树的中序遍历) | solution |
111 | minimum-depth-of-binary-tree(二叉树的最小深度)-simple | solution |
118 | pascals-triangle(杨辉三角)-simple | solution |
118 | pascals-triangle-ii(杨辉三角ii)-simple | solution |
141 | linked-list-cycle(环形链表)-simple | solution |
142 | linked-list-cycle-ii(环形链表II)-medium | solution |
144 | binary-tree-preorder-traversal(二叉树的前序遍历)-medium | solution |
145 | binary-tree-postorder-traversal(二叉树的后序遍历)-medium | solution |
146 | lru-cache(LRU缓存机制)-medium | solution |
151 | reverse-words-in-a-string(翻转字符串里的单词)-medium | solution |
155 | min-stack(最小栈) | solution |
191 | number-of-1-bits(位1的个数)-simple | solution |
203 | remove-linked-list-elements(移除链表元素)-simple | solution |
206 | reverse-linked-list(反转链表)-simple | solution |
209 | 209-minimum-size-subarray-sum(长度最小的子数组)-medium | solution |
227 | basic-calculator-ii(基本计算器ii)-medium | solution |
234 | palindrome-linked-list(回文链表)-simple | solution |
242 | valid-anagram(有效的字母异位词)-simple | solution |
283 | move-zeroes(移动零)-simple | solution |
300 | longest-increasing-subsequence(最长上升子序列) | solution |
344 | 344-reverse-string(反转字符串) | solution |
354 | russian-doll-envelopes(俄罗斯套娃信封问题) | solution |
372 | super-pow(超级次方)-medium | solution |
382 | linked-list-random-node(链表随机节点)-medium | solution |
392 | is-subsequence(判断子序列)-medium | solution |
398 | random-pick-index(随机数索引)-medium | solution |
416 | partition-equal-subset-sum(分割等和子集) | solution |
435 | non-overlapping-intervals(无重叠区间)-medium | solution |
438 | find-all-anagrams-in-a-string(找到字符串中所有字母异位词) | solution |
448 | find-all-numbers-disappeared-in-an-array(找到所有数组中消失的数组) | solution |
454 | 4sum-ii(四数相加II) | solution |
485 | 485-max-consecutive-ones(最大连续1的个数) | solution |
496 | next-greater-element-i(下一个更大元素)-simple | solution |
518 | coin-change-2(领钱兑换) | solution |
557 | reverse-words-in-a-string-iii(反转字符串中的单词iii) | solution |
561 | 561-array-partition-i(数组拆分i) | solution |
567 | permutation-in-string(字符串的排列)-medium | solution |
645 | set-mismatch(错误的集合)-simple | solution |
651 | 4-keys-keyboard(4键键盘)-medium | solution |
674 | longest-continuous-increasing-subsequence(寻找最长连续递增子序列)-simple | solution |
707 | design-linked-list(设计链表)-middle | solution |
724 | find-pivot-index(寻找数组的中心索引)-simple | solution |
733 | flood-fill(图像渲染)-simple | solution |
739 | daily-temperatures(每日温度)-medium | solution |
740 | binary-search(二分查找) | solution |
744 | find-smallest-letter-greater-than-target(寻找比目标字母大的最小字母) | solution |
752 | open-the-lock(打开转盘锁) | solution |
752 | stone-game(石子游戏)-medium | solution |
773 | sliding-puzzle(滑动谜题)-hard | solution |
875 | koko-eating-bananas(爱吃香蕉的珂珂)-hard | solution |
969 | pancake-sorting(煎饼排序)-medium | solution |
986 | interval-list-intersections(区间列表的交集)-medium | solution |
1011 | capacity-to-ship-packages-within-d-days(在 D 天内送达包裹的能力)-medium | solution |
1143 | longest-common-subsequence(最长公共子序列)-medium | solution |
55-1 | er-cha-shu-de-shen-du-lcof(二叉树的深度)-simple | solution |
-
Notifications
You must be signed in to change notification settings - Fork 0
linpenghui958/leetcode
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
leetcode练习记录
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published