若砚的博客

思路滑动窗口，一次通过！ public int longestOnes(int[] nums, int k) { int maxL = 0; int start = 0; int end = 0; int cnt = 0; while (end < nums.length) { if (nums[end] == 0) cnt++; while (cnt > k) {

思路深度优先搜索（一次做出来的！） public static int numIslands(char[][] grid) { int ret = 0; // grid是一个m行n列的矩阵 int m = grid.length; int n = grid[0].length; boolean[][] visited = new boolean[m][n]; int[] directions = {-1, 0, 1};

深度优先搜索 public boolean isSameTree(TreeNode p, TreeNode q) { if (p == null && q == null) return true; if (p == null || q == null) return false; if (p.val != q.val) return false; return isSameTree(p.left, q.left)

public static int triangleNumber(int[] nums) { int ret = 0; Arrays.sort(nums); int n = nums.length; for (int i = 0; i < n-1; i++) for (int j = i + 1; j < n; j++) { // range (nums[j] - nums[i], nums[i] + nums[j])

public static int hIndex(int[] citations) { int n = citations.length; if (citations[n - 1] == 0) return 0; int l = 0; int r = n - 1; while (l < r) { // find the citations[mid] <= n - mid int mid = l + (...

LeetCode 58

LeetCode 54, 59

【LeetCode 53】

比较复杂的方法。 public static List<List<String>> groupAnagrams(String[] strs) { List<List<String>> list = new ArrayList<List<String>>(); int n = strs.length; if (n == 0) return null; int[] pointers

 根据参考答案给出的一点提示，完成代码。 public static int firstMissingPositive(int[] nums) { int ret = 1; boolean flag = false; int posCount = 0; for (int i = 0; i < nums.length; i++) if (nums[i] > 0) posCount++; for (int i = 0