摘要： public int trap(int[] height) { int result = 0; int maxValue = -1; int maxAdder = 0; //取数组最大的下标和它的值 for (int i=0;i<height.length;i++) { if (height[i] 阅读全文

摘要： public int singleNumber(int[] nums) { int ans = 0; for (int i=0;i<32;i++) { int count = 0; for (int num : nums) { if (((num >>> i) &1) == 1) { count++ 阅读全文

摘要： public static boolean checkInclusion(String s1, String s2) { int[] charArray1 = new int[26]; int[] charArray2 = new int[26]; for (char c : s1.toCharAr 阅读全文

摘要： class Solution { public int characterReplacement(String s, int k) { int left =0,right=0; int maxLength = -1; int result = 0; char[] charNums = new cha 阅读全文

摘要： class Solution { public boolean wordBreak(String s, List<String> wordDict) { return isContain(s, wordDict); } Map<String,Boolean> map = new HashMap<>( 阅读全文