567. 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:TrueExplanation: s2 contains one permutation of s1 ("ba").

Example 2:

Input:s1= "ab" s2 = "eidboaoo"Output: False

Note:

1. The input strings only contain lower case letters.
2. The length of both given strings is in range [1, 10,000].

Subscribe to see which companies asked this question.

public class Solution {    public int[][] matrixReshape(int[][] nums, int r, int c) {        int row = nums.length;int column = nums[0].length;int ii = 0;int jj = 0;if (row * column != r * c)return nums;int[][] re = new int[r][c];for (int i = 0; i < r; ++i) {for (int j = 0; j < c; ++j) {re[i][j] = nums[ii][jj++];if (jj == column) {jj = 0;ii++;}}}return re;    }}