Skip to content

Commit b1561ad

Browse files
committed
note
1 parent 22831eb commit b1561ad

4 files changed

Lines changed: 21 additions & 4 deletions

File tree

‎src/main/java/com/chen/algorithm/znn/linkedlist/test19/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,7 @@
1515
*
1616
* @Auther: zhunn
1717
* @Date: 2020/10/22 14:51
18-
* @Description: 1、遍历length-n+1;2、栈、3、双指针法
18+
* @Description: 删除链表的倒数第N个节点 1、遍历length-n+1;2、栈、3、双指针法
1919
*/
2020
public class Solution {
2121

‎src/main/java/com/chen/algorithm/znn/linkedlist/test21/Solution.java‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -12,7 +12,7 @@
1212
*
1313
* @Author: zhunn
1414
* @Date: 2020-09-06 01:43
15-
* @Description: 并两个有序链表
15+
* @Description: 合并两个有序链表
1616
*/
1717
public class Solution {
1818

‎src/main/java/com/chen/algorithm/znn/stack/test155/Solution.java‎

Lines changed: 17 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,7 @@
11
package com.chen.algorithm.znn.stack.test155;
22

3+
import org.junit.Test;
4+
35
import java.util.Stack;
46

57
/**
@@ -55,4 +57,19 @@ public int top() {
5557
public int getMin() {
5658
return minStack.peek();
5759
}
60+
61+
@Test
62+
public void test() {
63+
Solution minStack = new Solution();
64+
minStack.push(-2);
65+
minStack.push(0);
66+
minStack.push(-3);
67+
int minRes = minStack.getMin();
68+
System.out.println(minRes);
69+
minStack.pop();
70+
int topRes = minStack.top();
71+
System.out.println(topRes);
72+
int minRes2 = minStack.getMin();
73+
System.out.println(minRes2);
74+
}
5875
}

‎src/main/java/com/chen/algorithm/znn/stack/test703/Solution.java‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -45,10 +45,10 @@ public KthLargest(int size, int[] nums) {
4545
public int add(int num) {
4646

4747
if (queue.size() < limit) {
48-
queue.offer(num);
48+
queue.add(num);
4949
} else if (queue.peek() < num) {
5050
queue.poll();
51-
queue.offer(num);
51+
queue.add(num);
5252
}
5353

5454
return queue.peek();

0 commit comments

Comments
 (0)