Leetcode 771. Jewels and Stones （Java）-CSDN博客

本文链接：https://blog.csdn.net/dzkqstranger/article/details/79734424

问题描述

You’re given strings J representing the types of stones that are jewels, and S representing the stones you have. Each character in S is a type of stone you have. You want to know how many of the stones you have are also jewels.

The letters in J are guaranteed distinct, and all characters in J and S are letters. Letters are case sensitive, so “a” is considered a different type of stone from “A”.

Example 1:
Input: J = “aA”, S = “aAAbbbb”
Output: 3

Example 2:
Input: J = “z”, S = “ZZ”
Output: 0

Note:
S and J will consist of letters and have length at most 50.
The characters in J are distinct.

解决方案

package test ;

import java.lang.* ;
import java.util.*;

class Solution {
    public int numJewelsInStones(String J, String S) {
        int result = 0 ;
        for (char c : J.toCharArray()){
            if (S.length() > 0 && S.contains(c + "")){
                result += S.length() - S.replaceAll(c + "", "").length() ;
            }
        }
        return result ;
    }

//  public int numJewelsInStones(String J, String S) {
//      return S.replaceAll("[^" + J + "]", "").length(); //前一个字符串为[^J],匹配未包含的任意字符
//  }
}
//public class Test{
//  public static void main(String[] args){
//      Solution s = new Solution() ;
//      String J = "z", S = "ZZ" ;
//      System.out.println("The number of jwerl is :" + s.numJewelsInStones(J, S)) ;
//    }
//}