feat: add solutions to lc problem: No.2206

No.2206.Divide Array Into Equal Pairs

Author: yanglbme

solution/2200-2299/2206.Divide Array Into Equal Pairs/README.md

@@ -72,7 +72,53 @@ class Solution:
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public boolean divideArray(int[] nums) {
+        int[] cnt = new int[510];
+        for (int v : nums) {
+            ++cnt[v];
+        }
+        for (int v : cnt) {
+            if (v % 2 != 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool divideArray(vector<int>& nums) {
+        vector<int> cnt(510);
+        for (int& v : nums) ++cnt[v];
+        for (int& v : cnt)
+            if (v % 2)
+                return false;
+        return true;
+    }
+};
+```
 
+### **Go**
+
+```go
+func divideArray(nums []int) bool {
+	cnt := make([]int, 510)
+	for _, v := range nums {
+		cnt[v]++
+	}
+	for _, v := range cnt {
+		if v%2 == 1 {
+			return false
+		}
+	}
+	return true
+}
 ```
 
 ### **TypeScript**

solution/2200-2299/2206.Divide Array Into Equal Pairs/README_EN.md

@@ -62,7 +62,53 @@ class Solution:
 ### **Java**
 
 ```java
+class Solution {
+    public boolean divideArray(int[] nums) {
+        int[] cnt = new int[510];
+        for (int v : nums) {
+            ++cnt[v];
+        }
+        for (int v : cnt) {
+            if (v % 2 != 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool divideArray(vector<int>& nums) {
+        vector<int> cnt(510);
+        for (int& v : nums) ++cnt[v];
+        for (int& v : cnt)
+            if (v % 2)
+                return false;
+        return true;
+    }
+};
+```
 
+### **Go**
+
+```go
+func divideArray(nums []int) bool {
+	cnt := make([]int, 510)
+	for _, v := range nums {
+		cnt[v]++
+	}
+	for _, v := range cnt {
+		if v%2 == 1 {
+			return false
+		}
+	}
+	return true
+}
 ```
 
 ### **TypeScript**

solution/2200-2299/2206.Divide Array Into Equal Pairs/Solution.cpp

@@ -0,0 +1,11 @@
+class Solution {
+public:
+    bool divideArray(vector<int>& nums) {
+        vector<int> cnt(510);
+        for (int& v : nums) ++cnt[v];
+        for (int& v : cnt)
+            if (v % 2)
+                return false;
+        return true;
+    }
+};

solution/2200-2299/2206.Divide Array Into Equal Pairs/Solution.go

@@ -0,0 +1,12 @@
+func divideArray(nums []int) bool {
+	cnt := make([]int, 510)
+	for _, v := range nums {
+		cnt[v]++
+	}
+	for _, v := range cnt {
+		if v%2 == 1 {
+			return false
+		}
+	}
+	return true
+}

solution/2200-2299/2206.Divide Array Into Equal Pairs/Solution.java

@@ -0,0 +1,14 @@
+class Solution {
+    public boolean divideArray(int[] nums) {
+        int[] cnt = new int[510];
+        for (int v : nums) {
+            ++cnt[v];
+        }
+        for (int v : cnt) {
+            if (v % 2 != 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+}