feat: add solutions to lc problem: No.0242. Valid Anagram

Author: yanglbme

solution/0100-0199/0122.Best Time to Buy and Sell Stock II/README.md

@@ -225,20 +225,20 @@ public class Solution {
 
 动态规划：
 
-```cs
 ```cs
 public class Solution {
     public int MaxProfit(int[] prices) {
         int f1 = -prices[0], f2 = 0;
-        for (int i = 1; i < prices.Length; ++i) {
+        for (int i = 1; i < prices.Length; ++i)
+        {
             f1 = Math.Max(f1, f2 - prices[i]);
             f2 = Math.Max(f2, f1 + prices[i]);
         }
         return f2;
     }
 }
 ```
-```
+
 
 ### **...**
 

solution/0100-0199/0122.Best Time to Buy and Sell Stock II/README_EN.md

@@ -205,7 +205,8 @@ Dynamic Programming:
 public class Solution {
     public int MaxProfit(int[] prices) {
         int f1 = -prices[0], f2 = 0;
-        for (int i = 1; i < prices.Length; ++i) {
+        for (int i = 1; i < prices.Length; ++i)
+        {
             f1 = Math.Max(f1, f2 - prices[i]);
             f2 = Math.Max(f2, f1 + prices[i]);
         }

solution/0200-0299/0242.Valid Anagram/README.md

@@ -80,6 +80,51 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool isAnagram(string s, string t) {
+        if (s.size() != t.size()) {
+            return false;
+        }
+        vector<int> chars(26, 0);
+        for (int i = 0, n = s.size(); i < n; ++i) {
+            ++chars[s[i] - 'a'];
+            --chars[t[i] - 'a'];
+        }
+        for (int i = 0; i < 26; ++i) {
+            if (chars[i] != 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+};
+```
+
+### **Go**
+
+```go
+func isAnagram(s string, t string) bool {
+	if len(s) != len(t) {
+		return false
+	}
+	var chars [26]int
+	for i := 0; i < len(s); i++ {
+		chars[s[i]-'a']++
+		chars[t[i]-'a']--
+	}
+	for i := 0; i < 26; i++ {
+		if chars[i] != 0 {
+			return false
+		}
+	}
+	return true
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0242.Valid Anagram/README_EN.md

@@ -72,6 +72,51 @@ class Solution {
 }
 ```
 
+### **C++**
+
+```cpp
+class Solution {
+public:
+    bool isAnagram(string s, string t) {
+        if (s.size() != t.size()) {
+            return false;
+        }
+        vector<int> chars(26, 0);
+        for (int i = 0, n = s.size(); i < n; ++i) {
+            ++chars[s[i] - 'a'];
+            --chars[t[i] - 'a'];
+        }
+        for (int i = 0; i < 26; ++i) {
+            if (chars[i] != 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+};
+```
+
+### **Go**
+
+```go
+func isAnagram(s string, t string) bool {
+	if len(s) != len(t) {
+		return false
+	}
+	var chars [26]int
+	for i := 0; i < len(s); i++ {
+		chars[s[i]-'a']++
+		chars[t[i]-'a']--
+	}
+	for i := 0; i < 26; i++ {
+		if chars[i] != 0 {
+			return false
+		}
+	}
+	return true
+}
+```
+
 ### **...**
 
 ```

solution/0200-0299/0242.Valid Anagram/Solution.cpp

@@ -0,0 +1,19 @@
+class Solution {
+public:
+    bool isAnagram(string s, string t) {
+        if (s.size() != t.size()) {
+            return false;
+        }
+        vector<int> chars(26, 0);
+        for (int i = 0, n = s.size(); i < n; ++i) {
+            ++chars[s[i] - 'a'];
+            --chars[t[i] - 'a'];
+        }
+        for (int i = 0; i < 26; ++i) {
+            if (chars[i] != 0) {
+                return false;
+            }
+        }
+        return true;
+    }
+};

solution/0200-0299/0242.Valid Anagram/Solution.go

@@ -0,0 +1,16 @@
+func isAnagram(s string, t string) bool {
+	if len(s) != len(t) {
+		return false
+	}
+	var chars [26]int
+	for i := 0; i < len(s); i++ {
+		chars[s[i]-'a']++
+		chars[t[i]-'a']--
+	}
+	for i := 0; i < 26; i++ {
+		if chars[i] != 0 {
+			return false
+		}
+	}
+	return true
+}