题目 |
题目传送门:传送门(点击此处)
题解 |
思路
使用hashmap
…稍后补上
code
package solution135;
class Solution {
public String solution(String s, String str) {
int[] count = new int[26];
for (int i = 0; i < s.length(); i++) {
count[s.charAt(i) - 97]++;
}
int[] backCount = count.clone();
for (int i = 0; i <= str.length() - s.length(); i++) {
int j = i;
boolean flag = true;
while (j < i + s.length() && flag) {
char c = str.charAt(j);
if (count[c - 97] == 0) flag = false;
else count[c - 97]--;
if (flag && j == i + s.length() - 1) return "YES";
j++;
}
count = backCount.clone();
}
return "NO";
}
}