feat: update solutions to leetcode problem: No.0771. Jewels and Stones

Author: yanglbme

solution/0500-0599/0535.Encode and Decode TinyURL/README.md

@@ -60,8 +60,7 @@ public class Codec {
 
     // Encodes a URL to a shortened URL.
     public String encode(String longUrl) {
-        ++count;
-        String code = Integer.toHexString(count);
+        String code = Integer.toHexString(++count);
         code2Url.put(code, longUrl);
         return prefixUrl + code;
     }

solution/0500-0599/0535.Encode and Decode TinyURL/README_EN.md

@@ -52,8 +52,7 @@ public class Codec {
 
     // Encodes a URL to a shortened URL.
     public String encode(String longUrl) {
-        ++count;
-        String code = Integer.toHexString(count);
+        String code = Integer.toHexString(++count);
         code2Url.put(code, longUrl);
         return prefixUrl + code;
     }

solution/0500-0599/0535.Encode and Decode TinyURL/Solution.java

@@ -5,8 +5,7 @@ public class Codec {
 
     // Encodes a URL to a shortened URL.
     public String encode(String longUrl) {
-        ++count;
-        String code = Integer.toHexString(count);
+        String code = Integer.toHexString(++count);
         code2Url.put(code, longUrl);
         return prefixUrl + code;
     }

solution/0700-0799/0771.Jewels and Stones/README.md

@@ -29,27 +29,62 @@
 	<li>&nbsp;<code>J</code>&nbsp;中的字符不重复。</li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
 
+哈希表实现。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def numJewelsInStones(self, jewels: str, stones: str) -> int:
+        jewel_set = {c for c in jewels}
+        return sum([1 for c in stones if c in jewel_set])
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int numJewelsInStones(String jewels, String stones) {
+        Set<Character> jewelSet = new HashSet<>();
+        for (char ch : jewels.toCharArray()) {
+            jewelSet.add(ch);
+        }
+        int res = 0;
+        for (char ch : stones.toCharArray()) {
+            res += (jewelSet.contains(ch) ? 1 : 0);
+        }
+        return res;
+    }
+}
+```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int numJewelsInStones(string jewels, string stones) {
+        unordered_set<char> jewelsSet;
+        for (int i = 0; i < jewels.length(); ++i) {
+            jewelsSet.insert(jewels[i]);
+        }
+        int res = 0;
+        for (int i = 0; i < stones.length(); ++i) {
+            res += jewelsSet.count(stones[i]);
+        }
+        return res;
+    }
+};
 ```
 
 ### **...**

solution/0700-0799/0771.Jewels and Stones/README_EN.md

@@ -25,21 +25,54 @@
 	<li>All the characters of&nbsp;<code>jewels</code> are <strong>unique</strong>.</li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
 
 ### **Python3**
 
 ```python
-
+class Solution:
+    def numJewelsInStones(self, jewels: str, stones: str) -> int:
+        jewel_set = {c for c in jewels}
+        return sum([1 for c in stones if c in jewel_set])
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int numJewelsInStones(String jewels, String stones) {
+        Set<Character> jewelSet = new HashSet<>();
+        for (char ch : jewels.toCharArray()) {
+            jewelSet.add(ch);
+        }
+        int res = 0;
+        for (char ch : stones.toCharArray()) {
+            res += (jewelSet.contains(ch) ? 1 : 0);
+        }
+        return res;
+    }
+}
+```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int numJewelsInStones(string jewels, string stones) {
+        unordered_set<char> jewelsSet;
+        for (int i = 0; i < jewels.length(); ++i) {
+            jewelsSet.insert(jewels[i]);
+        }
+        int res = 0;
+        for (int i = 0; i < stones.length(); ++i) {
+            res += jewelsSet.count(stones[i]);
+        }
+        return res;
+    }
+};
 ```
 
 ### **...**

solution/0700-0799/0771.Jewels and Stones/Solution.cpp

@@ -1,13 +1,14 @@
 class Solution {
 public:
-    int numJewelsInStones(string J, string S) {
-        std::unordered_map<char,int> count;
-        int number = 0;
-        for(char c: J) count[c]++;
-        for(char c: S){
-            if(count.find(c)!=count.end())
-                number++;
+    int numJewelsInStones(string jewels, string stones) {
+        unordered_set<char> jewelsSet;
+        for (int i = 0; i < jewels.length(); ++i) {
+            jewelsSet.insert(jewels[i]);
         }
-        return number;
+        int res = 0;
+        for (int i = 0; i < stones.length(); ++i) {
+            res += jewelsSet.count(stones[i]);
+        }
+        return res;
     }
-};
+};

solution/0700-0799/0771.Jewels and Stones/Solution.java

@@ -1,12 +1,12 @@
 class Solution {
-    public int numJewelsInStones(String J, String S) {
-        Set<Character> set = new HashSet<>();
-        for (char ch : J.toCharArray()) {
-            set.add(ch);
+    public int numJewelsInStones(String jewels, String stones) {
+        Set<Character> jewelSet = new HashSet<>();
+        for (char ch : jewels.toCharArray()) {
+            jewelSet.add(ch);
         }
         int res = 0;
-        for (char ch : S.toCharArray()) {
-            res += (set.contains(ch) ? 1 : 0);
+        for (char ch : stones.toCharArray()) {
+            res += (jewelSet.contains(ch) ? 1 : 0);
         }
         return res;
     }

solution/0700-0799/0771.Jewels and Stones/Solution.py

@@ -1,7 +1,4 @@
 class Solution:
-    def numJewelsInStones(self, J: str, S: str) -> int:
-        record = {ch for ch in J}
-        sum = 0
-        for ch in S:
-            sum += 1 if ch in record else 0
-        return sum
+    def numJewelsInStones(self, jewels: str, stones: str) -> int:
+        jewel_set = {c for c in jewels}
+        return sum([1 for c in stones if c in jewel_set])