feat: add solutions to lc problem: No.1512

No.1512.Number of Good Pairs

Author: YangFong

solution/1500-1599/1512.Number of Good Pairs/README.md

@@ -114,6 +114,48 @@ func numIdenticalPairs(nums []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numIdenticalPairs(nums: number[]): number {
+    const count = new Array(101).fill(0);
+    let ans = 0;
+    for (const num of nums) {
+        ans += count[num]++;
+    }
+    return ans;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn num_identical_pairs(nums: Vec<i32>) -> i32 {
+        let mut count = [0; 101];
+        let mut ans = 0;
+        for &num in nums.iter() {
+            ans += count[num as usize];
+            count[num as usize] += 1;
+        }
+        ans
+    }
+}
+```
+
+### **C**
+
+```c
+int numIdenticalPairs(int *nums, int numsSize) {
+    int count[101] = {0};
+    int ans = 0;
+    for (int i = 0; i < numsSize; i++) {
+        ans += count[nums[i]]++;
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1500-1599/1512.Number of Good Pairs/README_EN.md

@@ -106,6 +106,48 @@ func numIdenticalPairs(nums []int) int {
 }
 ```
 
+### **TypeScript**
+
+```ts
+function numIdenticalPairs(nums: number[]): number {
+    const count = new Array(101).fill(0);
+    let ans = 0;
+    for (const num of nums) {
+        ans += count[num]++;
+    }
+    return ans;
+}
+```
+
+### **Rust**
+
+```rust
+impl Solution {
+    pub fn num_identical_pairs(nums: Vec<i32>) -> i32 {
+        let mut count = [0; 101];
+        let mut ans = 0;
+        for &num in nums.iter() {
+            ans += count[num as usize];
+            count[num as usize] += 1;
+        }
+        ans
+    }
+}
+```
+
+### **C**
+
+```c
+int numIdenticalPairs(int *nums, int numsSize) {
+    int count[101] = {0};
+    int ans = 0;
+    for (int i = 0; i < numsSize; i++) {
+        ans += count[nums[i]]++;
+    }
+    return ans;
+}
+```
+
 ### **...**
 
 ```

solution/1500-1599/1512.Number of Good Pairs/Solution.c

@@ -0,0 +1,8 @@
+int numIdenticalPairs(int *nums, int numsSize) {
+    int count[101] = {0};
+    int ans = 0;
+    for (int i = 0; i < numsSize; i++) {
+        ans += count[nums[i]]++;
+    }
+    return ans;
+}

solution/1500-1599/1512.Number of Good Pairs/Solution.rs

@@ -0,0 +1,11 @@
+impl Solution {
+    pub fn num_identical_pairs(nums: Vec<i32>) -> i32 {
+        let mut count = [0; 101];
+        let mut ans = 0;
+        for &num in nums.iter() {
+            ans += count[num as usize];
+            count[num as usize] += 1;
+        }
+        ans
+    }
+}

solution/1500-1599/1512.Number of Good Pairs/Solution.ts

@@ -0,0 +1,8 @@
+function numIdenticalPairs(nums: number[]): number {
+    const count = new Array(101).fill(0);
+    let ans = 0;
+    for (const num of nums) {
+        ans += count[num]++;
+    }
+    return ans;
+}