1.leetcode主要选项是:
栈+双指针
题号 | 难度:简单 | 链接 |
---|---|---|
20 | 有效的括号 | https://blog.csdn.net/u011436427/article/details/94133622 |
26 | 删除排序数组中的重复项 | https://blog.csdn.net/u011436427/article/details/96468424 |
27 | 移除元素 | https://blog.csdn.net/u011436427/article/details/96514941 |
28 | 实现strStr() | https://blog.csdn.net/u011436427/article/details/96772700 |
88 | 合并两个有序数组 | https://blog.csdn.net/u011436427/article/details/97052256 |
125 | .验证回文串 | https://blog.csdn.net/u011436427/article/details/97188047 |
141 | 环形链表 | https://blog.csdn.net/u011436427/article/details/97306419 |
167 | 两数之和 II - 输入有序数组 | https://blog.csdn.net/u011436427/article/details/97613255 |
225 | 用队列实现栈 | https://blog.csdn.net/u011436427/article/details/97692026 |
232 | 用栈实现队列 | https://blog.csdn.net/u011436427/article/details/97830574 |
234 | 回文链表 | https://blog.csdn.net/u011436427/article/details/97978256 |
283 | 移动零 | https://blog.csdn.net/u011436427/article/details/98115873 |
344 | 反转字符串 | https://blog.csdn.net/u011436427/article/details/98386689 |
345 | 反转字符串中的元音字母 | https://blog.csdn.net/u011436427/article/details/98471469 |
349 | 两个数组的交集 | https://blog.csdn.net/u011436427/article/details/98533476 |
350 | 两个数组的交集 II | https://blog.csdn.net/u011436427/article/details/98664668 |
496 | 下一个更大元素 I | https://blog.csdn.net/u011436427/article/details/98791195 |
532 | 数组中的K-diff数对 | https://blog.csdn.net/u011436427/article/details/98891900 |
682 | 棒球比赛 | https://blog.csdn.net/u011436427/article/details/99108059 |
844 | 比较含退格的字符串 | https://blog.csdn.net/u011436427/article/details/99243601 |
925 | 长按键入 | https://blog.csdn.net/u011436427/article/details/99345056 |
977 | 有序数组的平方 | https://blog.csdn.net/u011436427/article/details/99484105 |
1021 | 删除最外层的括号 | https://blog.csdn.net/u011436427/article/details/99616028 |
1047 | 删除字符串中的所有相邻重复项 | https://blog.csdn.net/u011436427/article/details/99658037 |
2.leetcode主要选项是:
链接如下:https://leetcode-cn.com/problemset/all/?topicSlugs=two-pointers%2Cstring%2Cbinary-search%2Cmath%2Clinked-list%2Chash-table%2Carray%2Cqueue%2Ctree%2Csort%2Cdynamic-programming%2Crecursion%2Cdepth-first-search%2Cbreadth-first-search%2Cheap%2Cstack&difficulty=%E7%AE%80%E5%8D%95
题号 | 难度:简单 | 链接 | 说明 |
---|---|---|---|
分界 | 分界 | 分界 | 分界 |
1 | 两数之和 | https://blog.csdn.net/u011436427/article/details/99707060 | |
7 | 整数反转 | https://blog.csdn.net/u011436427/article/details/99707825 | |
9 | 回文数 | https://blog.csdn.net/u011436427/article/details/99766501 | |
13 | 有效的括号 罗马数字转整数 | https://blog.csdn.net/u011436427/article/details/99894226 | |
14 | 最长公共前缀 | https://blog.csdn.net/u011436427/article/details/100005610 | |
21 | 合并两个有序链表 | https://blog.csdn.net/u011436427/article/details/100026046 | |
35 | 搜索插入位置 | https://blog.csdn.net/u011436427/article/details/100065718 | 二分查找 |
38 | 报数 | https://blog.csdn.net/u011436427/article/details/100066685 | |
53 | 最大子序和 | https://blog.csdn.net/u011436427/article/details/100086929 | |
58 | 最后一个单词的长度 | https://blog.csdn.net/u011436427/article/details/100109648 | |
66 | 加一 | https://blog.csdn.net/u011436427/article/details/100128260 | |
67 | 二进制求和 | https://blog.csdn.net/u011436427/article/details/100148689 | |
69 | x的平方根 | https://blog.csdn.net/u011436427/article/details/100186044 | 二分查找 |
70 | 爬楼梯 | https://blog.csdn.net/u011436427/article/details/100187644 | 斐波那契数列,动态规划 |
83 | 删除排序链表中的重复元素 | https://blog.csdn.net/u011436427/article/details/100623258 | 链表,双指针,单指针,递归(递归思想) |
100 | 相同的树 | https://blog.csdn.net/u011436427/article/details/100625089 | 二叉树,递归 |
101 | 对称二叉树 | https://blog.csdn.net/u011436427/article/details/100639882 | 二叉树,递归 |
104 | 二叉树的最大深度 | https://blog.csdn.net/u011436427/article/details/100640329 | 二叉树,递归,DFS,BFS |
107 | 二叉树的层次遍历 II | https://blog.csdn.net/u011436427/article/details/100641019 | 二叉树,栈,队列,动态数组 |
20 | 有效的括号 | ||
20 | 有效的括号 | ||
20 | 有效的括号 |