摘要： package leetcode; import java.util.ArrayList; import java.util.Arrays; import java.util.Comparator; public class demo_406 { public int[][] reconstruct 阅读全文

摘要： package leetcode; public class demo_238 { public int[] productExceptSelf(int[] nums) { int[] left=new int[nums.length]; int[] right=new int[nums.lengt 阅读全文

摘要： package leetcode; public class demo_221 { public int maximalSquare(char[][] matrix) { if(matrix.length<0||matrix==null) { return 0; } int hegiht=matri 阅读全文

摘要： package leetcode; import java.util.ArrayList; import java.util.List; public class demo_448 { public List<Integer> findDisappearedNumbers(int[] nums) { 阅读全文

摘要： package leetcode; public class demo_494 { public int findTargetSumWays(int[] nums, int target) { int sum=0; for(int i=0;i<nums.length;i++) { sum=sum+n 阅读全文

摘要： package leetcode; import java.util.ArrayList; import java.util.Arrays; import java.util.List; public class demo_438 { public List<Integer> findAnagram 阅读全文

摘要： package leetcode; public class demo_461 { public int hammingDistance(int x, int y) { //异或后，不同的值则为1 int num=x^y; int sum=0; //转化成求二进制中1的个数 while(num>0) 阅读全文

摘要： package leetcode; import java.util.Arrays; public class demo_621 { public int leastInterval(char[] tasks, int n) { int nums[] =new int[26]; int sum=0; 阅读全文

摘要： package leetcode; import java.util.HashMap; public class demo_560 { public int subarraySum(int[] nums, int k) { int count=0; int preSum=0; //记录当前preSu 阅读全文

摘要： package leetcode; public class demo_200 { public int numIslands(char[][] grid) { int height=grid.length; int width=grid[0].length; int sum=0; //记录当前值是 阅读全文