Permutation in String
Given two strings s1 and s2 , write a function to return true if s2 contains the permutation of s1 . In other words, one of the first string's permutations is the substring of the second string. Example 1: Input: s1 = "ab" s2 = "eidbaooo" Output: True Explanation: s2 contains one permutation of s1 ("ba"). Example 2: Input: s1= "ab" s2 = "eidboaoo" Output: False Constraints: The input strings only contain lower case letters. The length of both given strings is in range [1, 10,000]. public class Solution { public boolean checkInclusion(String s1, String s2) { if (s1.length() > s2.length()) return false; int[] s1Arr = new int[26]; int s1Length = s1.length(), s2Length = s2.length(); for (int i = 0; i < s1Length; i++) s1Arr[s1.charAt(i) - 'a']++; for (int i = 0; i <= s2Length - s1Length; i++) { int[] s2Ar