feat: add solutions to lc problem: No.0500

No.0500.Keyboard Row

Author: yanglbme

solution/0500-0599/0500.Keyboard Row/README.md

@@ -51,7 +51,6 @@
 	<li><code>words[i]</code> 由英文字母（小写和大写字母）组成</li>
 </ul>
 
-
 ## 解法
 
 <!-- 这里可写通用的实现逻辑 -->
@@ -121,6 +120,63 @@ class Solution {
 }
 ```
 
+```java
+class Solution {
+    public String[] findWords(String[] words) {
+        String s = "12210111011122000010020202";
+        List<String> res = new ArrayList<>();
+        for (String word : words) {
+            Set<Character> t = new HashSet<>();
+            for (char c : word.toLowerCase().toCharArray()) {
+                t.add(s.charAt(c - 'a'));
+            }
+            if (t.size() == 1) {
+                res.add(word);
+            }
+        }
+        return res.toArray(new String[0]);
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<string> findWords(vector<string>& words) {
+        string s = "12210111011122000010020202";
+        vector<string> ans;
+        for (auto& word : words)
+        {
+            unordered_set<char> t;
+            for (char c : word) t.insert(s[tolower(c) - 'a']);
+            if (t.size() == 1) ans.push_back(word);
+        }
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func findWords(words []string) []string {
+	s := "12210111011122000010020202"
+	var ans []string
+	for _, word := range words {
+		t := make(map[byte]bool)
+		for _, c := range word {
+			t[s[unicode.ToLower(c)-'a']] = true
+		}
+		if len(t) == 1 {
+			ans = append(ans, word)
+		}
+	}
+	return ans
+}
+```
+
 ### **...**
 
 ```

solution/0500-0599/0500.Keyboard Row/README_EN.md

@@ -45,7 +45,6 @@
 	<li><code>words[i]</code> consists of English letters (both lowercase and uppercase).&nbsp;</li>
 </ul>
 
-
 ## Solutions
 
 <!-- tabs:start -->
@@ -96,6 +95,63 @@ class Solution {
 }
 ```
 
+```java
+class Solution {
+    public String[] findWords(String[] words) {
+        String s = "12210111011122000010020202";
+        List<String> res = new ArrayList<>();
+        for (String word : words) {
+            Set<Character> t = new HashSet<>();
+            for (char c : word.toLowerCase().toCharArray()) {
+                t.add(s.charAt(c - 'a'));
+            }
+            if (t.size() == 1) {
+                res.add(word);
+            }
+        }
+        return res.toArray(new String[0]);
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<string> findWords(vector<string>& words) {
+        string s = "12210111011122000010020202";
+        vector<string> ans;
+        for (auto& word : words)
+        {
+            unordered_set<char> t;
+            for (char c : word) t.insert(s[tolower(c) - 'a']);
+            if (t.size() == 1) ans.push_back(word);
+        }
+        return ans;
+    }
+};
+```
+
+### **Go**
+
+```go
+func findWords(words []string) []string {
+	s := "12210111011122000010020202"
+	var ans []string
+	for _, word := range words {
+		t := make(map[byte]bool)
+		for _, c := range word {
+			t[s[unicode.ToLower(c)-'a']] = true
+		}
+		if len(t) == 1 {
+			ans = append(ans, word)
+		}
+	}
+	return ans
+}
+```
+
 ### **...**
 
 ```

solution/0500-0599/0500.Keyboard Row/Solution.cpp

@@ -0,0 +1,14 @@
+class Solution {
+public:
+    vector<string> findWords(vector<string>& words) {
+        string s = "12210111011122000010020202";
+        vector<string> ans;
+        for (auto& word : words)
+        {
+            unordered_set<char> t;
+            for (char c : word) t.insert(s[tolower(c) - 'a']);
+            if (t.size() == 1) ans.push_back(word); 
+        }
+        return ans;
+    }
+};

solution/0500-0599/0500.Keyboard Row/Solution.go

@@ -0,0 +1,14 @@
+func findWords(words []string) []string {
+	s := "12210111011122000010020202"
+	var ans []string
+	for _, word := range words {
+		t := make(map[byte]bool)
+		for _, c := range word {
+			t[s[unicode.ToLower(c)-'a']] = true
+		}
+		if len(t) == 1 {
+			ans = append(ans, word)
+		}
+	}
+	return ans
+}

solution/0500-0599/0500.Keyboard Row/Solution.java

@@ -1,22 +1,13 @@
 class Solution {
     public String[] findWords(String[] words) {
-        String s1 = "qwertyuiopQWERTYUIOP";
-        String s2 = "asdfghjklASDFGHJKL";
-        String s3 = "zxcvbnmZXCVBNM";
+        String s = "12210111011122000010020202";
         List<String> res = new ArrayList<>();
         for (String word : words) {
-            int n1 = 0, n2 = 0, n3 = 0;
-            int n = word.length();
-            for (int i = 0; i < n; ++i) {
-                if (s1.contains(String.valueOf(word.charAt(i)))) {
-                    ++n1;
-                } else if (s2.contains(String.valueOf(word.charAt(i)))) {
-                    ++n2;
-                } else {
-                    ++n3;
-                }
+            Set<Character> t = new HashSet<>();
+            for (char c : word.toLowerCase().toCharArray()) {
+                t.add(s.charAt(c - 'a'));
             }
-            if (n1 == n || n2 == n || n3 == n) {
+            if (t.size() == 1) {
                 res.add(word);
             }
         }