给定字符串J 代表石头中宝石的类型,和字符串 S代表你拥有的石头。 S 中每个字符代表了一种你拥有的石头的类型,你想知道你拥有的石头中有多少是宝石。
J 中的字母不重复,J 和 S中的所有字符都是字母。字母区分大小写,因此"a"和"A"是不同类型的石头。
示例 1:
输入: J = “aA”,
S = “aAAbbbb” 输出: 3
示例 2:
输入: J = “z”,
S = “ZZ” 输出: 0
注意:
- S 和 J 最多含有50个字母。
- J 中的字符不重复。
Java实现:
//方法一:暴力法
class Solution {
public int numJewelsInStones(String J, String S) {
int jewelsCount = 0;
int jewelsLength = J.length(), stonesLength = S.length();
for (int i = 0; i < stonesLength; i++) {
char stone = S.charAt(i);
for (int j = 0; j < jewelsLength; j++) {
char jewel = J.charAt(j);
if (stone == jewel) {
jewelsCount++;
break;
}
}
}
return jewelsCount;
}
}
// 方法二:哈希集合
class Solution {
public int numJewelsInStones(String J, String S) {
int jewelsCount = 0;
Set<Character> jewelsSet = new HashSet<Character>();
int jewelsLength = J.length(), stonesLength = S.length();
for (int i = 0; i < jewelsLength; i++) {
char jewel = J.charAt(i);
jewelsSet.add(jewel);
}
for (int i = 0; i < stonesLength; i++) {
char stone = S.charAt(i);
if (jewelsSet.contains(stone)) {
jewelsCount++;
}
}
return jewelsCount;
}
}
public class MainClass {
public static String stringToString(String input) {
if (input == null) {
return "null";
}
return Json.value(input).toString();
}
public static void main(String[] args) throws IOException {
BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
String line;
while ((line = in.readLine()) != null) {
String J = stringToString(line);
line = in.readLine();
String S = stringToString(line);
int ret = new Solution().numJewelsInStones(J, S);
String out = String.valueOf(ret);
System.out.print(out);
}
}
}