MintHelen的博客

剑指 Offer 04. 二维数组中的查找 1.暴力解题 对空间进行遍历 class Solution { public boolean findNumberIn2DArray(int[][] matrix, int target) { if(matrix == null || matrix.length ==0 || matrix[0].length == 0){ return false; } int n = matrix.

剑指 Offer 03. 数组中重复的数字 1.暴力写法 class Solution { public int findRepeatNumber(int[] nums) { int[] a = new int[100000]; int max = 0,sum; for(int i = 0; i < nums.length;i++){ sum = nums[i]; a[sum]++;