# [771. Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/)   int numJewelsInStones(char * jewels, char * stones){ int n=0; for(int i=0;i<strlen(stones);i++) { for(int j=0;j<strlen(jewels);j++) { if(stones[i] == jewels[j]) { n++; } } } return n; }
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up