Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 372335e

Browse files
committed
201907007
1 parent f979b80 commit 372335e

File tree

6 files changed

+14
-9
lines changed

6 files changed

+14
-9
lines changed

‎code/lc11.java

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -5,6 +5,7 @@
55
* 难度:Medium
66
* 分类:Array, Two Pointers
77
* Tips:复杂度可以为O(N), 指针往里走, 若值也小了,则面积一定不会增大。和lc42做比较
8+
* lc11, lc42, lc84
89
*/
910
public class lc11 {
1011
public static void main(String[] args) {

‎code/lc146.java

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@
1111
import java.util.HashMap;
1212

1313
public class lc146 {
14-
class Node {
14+
class Node {//定义一个Node类
1515
int key;
1616
int value;
1717
Node pre;
@@ -25,8 +25,8 @@ public Node(int key, int value) {
2525
public class LRUCache {
2626

2727
HashMap<Integer, Node> map;
28-
int capicity, count;
29-
Node head, tail;
28+
int capicity, count;//最大容量,当前容量
29+
Node head, tail;//头节点,尾节点
3030

3131
public LRUCache(int capacity) {
3232
this.capicity = capacity;
@@ -40,7 +40,7 @@ public LRUCache(int capacity) {
4040
count = 0;
4141
}
4242

43-
public void deleteNode(Node node) {
43+
public void deleteNode(Node node) {//两个方法
4444
node.pre.next = node.next;
4545
node.next.pre = node.pre;
4646
}

‎code/lc322.java

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -39,15 +39,15 @@ public static int coinChange(int[] coins, int amount) {
3939
public static int coinChange2(int[] coins, int amount) {
4040
int max = amount + 1;
4141
int[] dp = new int[amount + 1];
42-
Arrays.fill(dp, max);
43-
dp[0] = 0;
42+
Arrays.fill(dp, max);//表示无解
43+
dp[0] = 0;//dp[0]=0 不用先把零钱设为1了
4444
for (int i = 1; i <= amount; i++) {
4545
for (int j = 0; j < coins.length; j++) {
4646
if (coins[j] <= i) {
4747
dp[i] = Math.min(dp[i], dp[i - coins[j]] + 1);
4848
}
4949
}
5050
}
51-
return dp[amount] > amount ? -1 : dp[amount];
51+
return dp[amount] > amount ? -1 : dp[amount];//判断一下
5252
}
5353
}

‎code/lc42.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@
88
* 难度:Hard
99
* 分类:Array, Two Pointers, Stack
1010
* 思路:三种方法:1.DP先求出来每个位置的maxleft,maxright,再遍历一遍;2.两个指针,类似lc11题的思路;3.用栈数据结构;
11-
* Tips:
11+
* Tips:lc11, lc42, lc84
1212
*/
1313
public class lc42 {
1414
public static void main(String[] args) {

‎code/lc84.java

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@
1010
* 思路:两种方法:1.用dp找到边界,再遍历一遍; 2.用栈,栈内存索引,保证栈内索引对应的高度是递增的,若减了即找到了右边界,出栈开始计算。因为栈内是递增的,左边界就是上个栈内的元素。若栈为空,左边界就是-1。
1111
* Tips:和lc42做比较,都可以用栈或者dp来做. 很难,栈的操作很难想到.
1212
* 和lc42 dp作比较 和lc32栈做比较
13-
* lc85
13+
* lc11, lc42, lc84
1414
*/
1515
public class lc84 {
1616
public static void main(String[] args) {

‎readme.md

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -131,6 +131,7 @@ LeetCode 指南
131131
| 150 [Java](./code/lc150.java)
132132
| 151 [Java](./code/lc151.java)
133133
| 152 [Java](./code/lc152.java)
134+
| 153 [Java](./code/lc153.java)
134135
| 155 [Java](./code/lc155.java)
135136
| 160 [Java](./code/lc160.java)
136137
| 162 [Java](./code/lc162.java)
@@ -144,6 +145,7 @@ LeetCode 指南
144145
| 190 [Java](./code/lc190.java)
145146
| 191 [Java](./code/lc191.java)
146147
| 198 [Java](./code/lc198.java)
148+
| 199 [Java](./code/lc199.java)
147149
| 200 [Java](./code/lc200.java)
148150
| 202 [Java](./code/lc202.java)
149151
| 204 [Java](./code/lc204.java)
@@ -209,6 +211,7 @@ LeetCode 指南
209211
| 448 [Java](./code/lc448.java)
210212
| 454 [Java](./code/lc454.java)
211213
| 461 [Java](./code/lc461.java)
214+
| 493 [Java](./code/lc493.java)
212215
| 494 [Java](./code/lc494.java)
213216
| 538 [Java](./code/lc538.java)
214217
| 543 [Java](./code/lc543.java)
@@ -227,6 +230,7 @@ LeetCode 指南
227230
| 771 [Java](./code/lc771.java)
228231
| 834 [Java](./code/lc834.java)
229232
| 877 [Java](./code/lc877.java)
233+
| 912 [Java](./code/lc912.java)
230234
| 921 [Java](./code/lc921.java)
231235
| 922 [Java](./code/lc922.java)
232236
| 923 [Java](./code/lc923.java)

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /