567. Permutation in String https://www.youtube.com/watch?v=wpq03MmEHIM&t=14s https://leetcode.com/problems/permutation-in-string/solution/ Sliding Window Try use int[] array Line 12: error: illegal start of type class Solution { public boolean checkInclusion(String s1, String s2) { int[] array1 = new int[26]; /////// int[] , not char[] int[] array2 = new int[26]; for(int i = 0; i < s1.length(); i++){ array1[s1.charAt(i) - 'a']++; //////// char - ‘a’ = a number, ‘a’ - ‘a’ = 0, ‘b’ - ‘a’ = 1 array2[s2.charAt(i) - 'a']++; } } for(int i = s1.length() - 1; i < s2.length - 1; i++){ /////// range if(match(array1, array2){ return true; } // - prev array2[s2.charAt(i + 1 - s1.length()) - 'a']--; ///// index , easy to mess up // + new array2[s2.charAt(i + 1) - 'a']++; } return match(array1, array2); private boolean (int[] array1, int[] array2){ for(int i = 0; i < 26; i++){ if(array1[i] != array2[i]){ return false; } return true; } }
567. Permutation in String
猜你喜欢
转载自www.cnblogs.com/tobeabetterpig/p/9451099.html
今日推荐
周排行