feat: add solutions to lc problem: No.0771

No.0771.Jewels and Stones

Author: YangFong

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

@@ -123,6 +123,53 @@ var numJewelsInStones = function (jewels, stones) {
 };
 ```
 
+### **TypeScript**
+
+```ts
+function numJewelsInStones(jewels: string, stones: string): number {
+    const set = new Set([...jewels]);
+    let ans = 0;
+    for (const c of stones) {
+        set.has(c) && ans++;
+    }
+    return ans;
+}
+```
+
+### **Rust**
+
+```rust
+use std::collections::HashSet;
+impl Solution {
+    pub fn num_jewels_in_stones(jewels: String, stones: String) -> i32 {
+        let mut set = jewels.as_bytes().iter().collect::<HashSet<&u8>>();
+        let mut ans = 0;
+        for c in stones.as_bytes() {
+            if set.contains(c) {
+                ans += 1;
+            }
+        }
+        ans
+    }
+}
+```
+
+### **C**
+
+```c
+int numJewelsInStones(char *jewels, char *stones) {
+    int set[128] = {0};
+    for (int i = 0; jewels[i]; i++) {
+        set[jewels[i]] = 1;
+    }
+    int ans = 0;
+    for (int i = 0; stones[i]; i++) {
+        set[stones[i]] && ans++;
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

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

@@ -100,6 +100,53 @@ var numJewelsInStones = function (jewels, stones) {
 };
 ```
 
+### **TypeScript**
+
+```ts
+function numJewelsInStones(jewels: string, stones: string): number {
+    const set = new Set([...jewels]);
+    let ans = 0;
+    for (const c of stones) {
+        set.has(c) && ans++;
+    }
+    return ans;
+}
+```
+
+### **Rust**
+
+```rust
+use std::collections::HashSet;
+impl Solution {
+    pub fn num_jewels_in_stones(jewels: String, stones: String) -> i32 {
+        let mut set = jewels.as_bytes().iter().collect::<HashSet<&u8>>();
+        let mut ans = 0;
+        for c in stones.as_bytes() {
+            if set.contains(c) {
+                ans += 1;
+            }
+        }
+        ans
+    }
+}
+```
+
+### **C**
+
+```c
+int numJewelsInStones(char *jewels, char *stones) {
+    int set[128] = {0};
+    for (int i = 0; jewels[i]; i++) {
+        set[jewels[i]] = 1;
+    }
+    int ans = 0;
+    for (int i = 0; stones[i]; i++) {
+        set[stones[i]] && ans++;
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

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

@@ -0,0 +1,11 @@
+int numJewelsInStones(char *jewels, char *stones) {
+    int set[128] = {0};
+    for (int i = 0; jewels[i]; i++) {
+        set[jewels[i]] = 1;
+    }
+    int ans = 0;
+    for (int i = 0; stones[i]; i++) {
+        set[stones[i]] && ans++;
+    }
+    return ans;
+}

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

@@ -0,0 +1,13 @@
+use std::collections::HashSet;
+impl Solution {
+    pub fn num_jewels_in_stones(jewels: String, stones: String) -> i32 {
+        let mut set = jewels.as_bytes().iter().collect::<HashSet<&u8>>();
+        let mut ans = 0;
+        for c in stones.as_bytes() {
+            if set.contains(c) {
+                ans += 1;
+            }
+        }
+        ans
+    }
+}

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

@@ -0,0 +1,8 @@
+function numJewelsInStones(jewels: string, stones: string): number {
+    const set = new Set([...jewels]);
+    let ans = 0;
+    for (const c of stones) {
+        set.has(c) && ans++;
+    }
+    return ans;
+}