feat: add golang solution to lc problem: No.2103

No.2103.Rings and Rods

Author: yanglbme

solution/2100-2199/2103.Rings and Rods/README.md

@@ -80,7 +80,7 @@ class Solution:
         for i in range(1, len(rings), 2):
             c = int(rings[i])
             mp[c].add(rings[i - 1])
-        return sum(1 for v in mp.values() if len(v) == 3)
+        return sum(len(v) == 3 for v in mp.values())
 ```
 
 ### **Java**
@@ -127,9 +127,29 @@ public:
 };
 ```
 
-### **TypeScript**
+### **Go**
+
+```go
+func countPoints(rings string) int {
+	mp := make(map[byte]map[byte]bool)
+	for i := 1; i < len(rings); i += 2 {
+		c := rings[i]
+		if len(mp[c]) == 0 {
+			mp[c] = make(map[byte]bool)
+		}
+		mp[c][rings[i-1]] = true
+	}
+	ans := 0
+	for _, v := range mp {
+		if len(v) == 3 {
+			ans++
+		}
+	}
+	return ans
+}
+```
 
-<!-- 这里可写当前语言的特殊实现逻辑 -->
+### **TypeScript**
 
 ```ts
 

solution/2100-2199/2103.Rings and Rods/README_EN.md

@@ -75,7 +75,7 @@ class Solution:
         for i in range(1, len(rings), 2):
             c = int(rings[i])
             mp[c].add(rings[i - 1])
-        return sum(1 for v in mp.values() if len(v) == 3)
+        return sum(len(v) == 3 for v in mp.values())
 ```
 
 ### **Java**
@@ -120,6 +120,28 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func countPoints(rings string) int {
+	mp := make(map[byte]map[byte]bool)
+	for i := 1; i < len(rings); i += 2 {
+		c := rings[i]
+		if len(mp[c]) == 0 {
+			mp[c] = make(map[byte]bool)
+		}
+		mp[c][rings[i-1]] = true
+	}
+	ans := 0
+	for _, v := range mp {
+		if len(v) == 3 {
+			ans++
+		}
+	}
+	return ans
+}
+```
+
 ### **TypeScript**
 
 ```ts

solution/2100-2199/2103.Rings and Rods/Solution.go

@@ -0,0 +1,17 @@
+func countPoints(rings string) int {
+	mp := make(map[byte]map[byte]bool)
+	for i := 1; i < len(rings); i += 2 {
+		c := rings[i]
+		if len(mp[c]) == 0 {
+			mp[c] = make(map[byte]bool)
+		}
+		mp[c][rings[i-1]] = true
+	}
+	ans := 0
+	for _, v := range mp {
+		if len(v) == 3 {
+			ans++
+		}
+	}
+	return ans
+}

solution/2100-2199/2103.Rings and Rods/Solution.py

@@ -4,4 +4,4 @@ def countPoints(self, rings: str) -> int:
         for i in range(1, len(rings), 2):
             c = int(rings[i])
             mp[c].add(rings[i - 1])
-        return sum(1 for v in mp.values() if len(v) == 3)
+        return sum(len(v) == 3 for v in mp.values())