fd

Author: dingjikerbo

README.md

@@ -382,4 +382,5 @@
 |653|[Two Sum IV - Input is a BST](https://leetcode.com/problems/two-sum-iv-input-is-a-bst/)| [Java](leetcode/solution/src/TwoSumIV.java)|90||
 |654|[Maximum Binary Tree](https://leetcode.com/problems/maximum-binary-tree/description/)|[Java](leetcode/solution/src/MaximumBinaryTree.java)|100||
 |669|[Trim a Binary Search Tree](https://leetcode.com/problems/trim-a-binary-search-tree/)|[Java](leetcode/solution/src/TrimABinarySearchTree.java)|100||
-|684|[Redundant Connection](https://leetcode.com/problems/redundant-connection/)| [Java](leetcode/solution/src/RedundantConnection.java)|||
+|684|[Redundant Connection](https://leetcode.com/problems/redundant-connection/)| [Java](leetcode/solution/src/RedundantConnection.java)|||
+|771|[Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/)|[Java](leetcode/solution/src/JewelsAndStones.java)|100||

leetcode/solution/src/JewelsAndStones.java

@@ -0,0 +1,16 @@
+public class JewelsAndStones {
+
+    public int numJewelsInStones(String J, String S) {
+        int character[] = new int[256];
+        for (char c : J.toCharArray()) {
+            character[c]++;
+        }
+        int count = 0;
+        for (char c : S.toCharArray()) {
+            if (character[c] > 0) {
+                count++;
+            }
+        }
+        return count;
+    }
+}