题解

Leetcode

easy

• [x] 1、两数之和 (opens new window)

• [x] 14、最长公共前缀 (opens new window)

• [x] 20、有效的括号 (opens new window)

• [x] 21、合并两个有序链表 (opens new window)

• [x] 28、实现 subStr (opens new window)

• [x] 35、搜索插入的位置 (opens new window)

• [x] 70、爬楼梯 (opens new window)

• [x] 83、删除排序链表中的重复元素 (opens new window)

• [x] 88、合并两个有序数组 (opens new window)

• [x] 102、二叉树的层序遍历 (opens new window)

• [x] 108、将有序数组转换成二叉搜索树 (opens new window)

• [x] 110、平衡二叉树 (opens new window)

• [x] 141、环形链表 (opens new window)

• [x] 144、二叉树的前序遍历 (opens new window)

• [x] 206、反转链表 (opens new window)

• [x] 226、翻转二叉树 (opens new window)

• [x] 232、用栈实现队列 (opens new window)

• [x] 680、验证回文字符串 II (opens new window)

• [x] 724、寻找数组的中心下标 (opens new window)

• [x] 1991、找到数组的中间位置 (opens new window)

medium

• [x] 5、最长回文字符串 (opens new window)

• [x] 8、字符串转换整数 aoti (opens new window)

• [x] 15、三数之和 (opens new window)

• [x] 19、删除链表的倒数第 N 个结点 (opens new window)

• [x] 46、全排列 (opens new window)

• [x] 56、合并区间 (opens new window)

• [x] 77、组合 (opens new window)

• [x] 78、子集 (opens new window)

• [x] 82、删除排序链表中的重复元素 II (opens new window)

• [x] 92、反转链表 II (opens new window)

• [x] 98、验证二叉搜索树 (opens new window)

• [x] 142、环形链表 II (opens new window)

• [x] 151、翻转字符串里的单词 (opens new window)

• [x] 155、最小栈 (opens new window)

• [x] 211、添加与搜索单词 (opens new window)

• [x] 322、零钱兑换 (opens new window)

• [x] 334、反转字符串 (opens new window)

• [x] 622、设计循环队列 (opens new window)

• [x] 707、设计链表 (opens new window)

• [x] 739、每日温度 (opens new window)

hard

• [x] 239、滑动窗口最大值 (opens new window)

PAT

B

• [x] B1001、害死人不偿命的(3n + 1)猜想 (opens new window)