上一页 1 2 3 4 5 6 7 8 ··· 13 下一页
摘要: class Solution { public int maxValue(int[][] grid) { int rows = grid.length; int cols = grid[0].length; //int dp[0][0] = grid[0][0]; for(int i=0;i<row 阅读全文
posted @ 2020-12-16 19:07 peanut_zh 阅读(77) 评论(0) 推荐(0) 编辑
摘要: //找规律法 class Solution { public int maxSubArray(int[] nums) { //全局变量标记是否输入无效 boolean isInvalidInput = false; if(nums == null || nums.length <= 0){ isIn 阅读全文
posted @ 2020-12-16 16:32 peanut_zh 阅读(58) 评论(0) 推荐(0) 编辑
摘要: class Solution { public int[] getLeastNumbers(int[] arr, int k) { if(k==0||arr.length<=0){ return new int[0]; } //默认是最小根堆,实现大根堆需要重写比较器 Queue<Integer> 阅读全文
posted @ 2020-12-16 13:17 peanut_zh 阅读(48) 评论(0) 推荐(0) 编辑
摘要: public class Solution { public int MoreThanHalfNum_Solution(int [] array) { //定义一个计数器count,存放众数的变量 card int card = 0; int count = 0; //找这个数字,一样就 计数加1, 阅读全文
posted @ 2020-12-16 11:29 peanut_zh 阅读(71) 评论(0) 推荐(0) 编辑
摘要: /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ 阅读全文
posted @ 2020-12-15 17:06 peanut_zh 阅读(66) 评论(0) 推荐(0) 编辑
摘要: class Solution { public boolean verifyPostorder(int[] postorder) { return verifySquenceofBST(postorder,0,postorder.length-1); } boolean verifySquenceo 阅读全文
posted @ 2020-12-15 16:30 peanut_zh 阅读(90) 评论(0) 推荐(0) 编辑
摘要: /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ 阅读全文
posted @ 2020-12-15 15:30 peanut_zh 阅读(93) 评论(0) 推荐(0) 编辑
摘要: /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ 阅读全文
posted @ 2020-12-15 15:01 peanut_zh 阅读(78) 评论(0) 推荐(0) 编辑
摘要: import java.util.ArrayList; import java.util.Queue; import java.util.LinkedList; /** public class TreeNode { int val = 0; TreeNode left = null; TreeNo 阅读全文
posted @ 2020-12-15 14:51 peanut_zh 阅读(77) 评论(0) 推荐(0) 编辑
摘要: class Solution { public boolean validateStackSequences(int[] pushed, int[] popped) { Stack<Integer> stack = new Stack<>(); int index = 0; for(int x : 阅读全文
posted @ 2020-12-15 12:20 peanut_zh 阅读(70) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 ··· 13 下一页