![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
栈
三岁就很萌@D
这个作者很懒,什么都没留下…
展开
-
LeetCode-739 每日温度
class Solution { class Node{ int val; int index; public Node(int val,int index){ this.val = val; this.index = index; } } public int[] dailyTemperatures(int[] temperatures) { int .原创 2021-12-11 15:44:25 · 286 阅读 · 0 评论 -
LeetCode-735 行星碰撞
class Solution { public int[] asteroidCollision(int[] asteroids) { Deque<Integer> stack = new LinkedList<Integer>(); int length = asteroids.length; for(int i = 0;i < length; i++) { boolean fla.原创 2021-12-11 15:42:28 · 1840 阅读 · 0 评论 -
LeetCode321 拼接最大数
class Solution { public int[] maxNumber(int[] nums1, int[] nums2, int k) { int[] maxSequence = new int[k];//最大序列 int length1 = nums1.length; int length2 = nums2.length; int start = Math.max(0,k - length2); .原创 2021-12-05 14:27:04 · 188 阅读 · 0 评论 -
LeetCode-402 移掉K位数字
class Solution { public String removeKdigits(String num, int k) { if(num.equals("")) //空字符串直接返回本身即可 return num; StringBuffer ans = new StringBuffer(); int length = num.length(); ans.append(num.charAt(0)).原创 2021-12-05 10:27:15 · 684 阅读 · 0 评论 -
leetcode-316去除重复字母
class Solution { public String removeDuplicateLetters(String s) { int[] nums = new int[26]; int[] exist = new int[26]; int length = s.length(); for(int i = 0;i<length;i++){//记录每个字母出现了多少次 int index = s.charAt(i) - '原创 2021-12-04 21:12:52 · 61 阅读 · 0 评论 -
LeetCode-155 最小栈
class MinStack { //借用额外的栈 List<Integer> stack = new ArrayList<Integer>(); List<Integer> min = new ArrayList<Integer>(); public MinStack() { } public void push(int val) { stack.add(val)..原创 2021-11-29 22:17:58 · 1021 阅读 · 0 评论 -
LeetCode-42 接雨水
class Solution { //动态规划 public int trap(int[] height) { int length = height.length; if(length==0) return 0; int[] leftMax = new int[length]; int[] rightMax = new int[length]; leftMax[0] = height[0.原创 2021-11-28 12:19:27 · 69 阅读 · 0 评论