leetcode 771. Jewels and Stones

Seawolf

1. 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.
   
2. 
   
3. 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".
   
4. 
   
5. Example 1:
   
6. 
   
7. Input: J = "aA", S = "aAAbbbb"
   
8. Output: 3
   
9. Example 2:
   
10. 
    
11. Input: J = "z", S = "ZZ"
    
12. Output: 0
    
13. Note:
    
14. 
    
15. S and J will consist of letters and have length at most 50.
    
16. The characters in J are distinct.

复制代码

1. class Solution {
   
2.     public int numJewelsInStones(String J, String S) {
   
3.         
   
4.         if(S.length() == 0) return 0;
   
5.         
   
6.         char[] charArray = S.toCharArray();
   
7.         int count = 0;
   
8.         
   
9.         for(char i : charArray){
   
10.             
    
11.             if(J.indexOf(i) != -1){
    
12.                
    
13.                 count++;
    
14.             }
    
15.         }
    
16.         
    
17.         return count;
    
18.     }
    
19. }

复制代码