feat: add solutions to lc problem: No.0447.Number of Boomerangs

Author: maolonglong

solution/0400-0499/0447.Number of Boomerangs/README.md

@@ -111,6 +111,45 @@ class Solution {
 }
 ```
 
+### **Go**
+
+```go
+func numberOfBoomerangs(points [][]int) int {
+	ans := 0
+	for _, p := range points {
+		cnt := make(map[int]int)
+		for _, q := range points {
+			cnt[(p[0]-q[0])*(p[0]-q[0])+(p[1]-q[1])*(p[1]-q[1])]++
+		}
+		for _, v := range cnt {
+			ans += v * (v - 1)
+		}
+	}
+	return ans
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int numberOfBoomerangs(vector<vector<int>>& points) {
+        int ans = 0;
+        for (const auto& p : points) {
+        unordered_map<int, int> cnt;
+            for (const auto& q : points) {
+                ++cnt[(p[0] - q[0]) * (p[0] - q[0]) + (p[1] - q[1]) * (p[1] - q[1])];
+            }
+            for (const auto& [_, v] : cnt) {
+                ans += v * (v - 1);
+            }
+        }
+        return ans;
+    }
+};
+```
+
 ### **...**
 
 ```

solution/0400-0499/0447.Number of Boomerangs/README_EN.md

@@ -99,6 +99,45 @@ class Solution {
 }
 ```
 
+### **Go**
+
+```go
+func numberOfBoomerangs(points [][]int) int {
+	ans := 0
+	for _, p := range points {
+		cnt := make(map[int]int)
+		for _, q := range points {
+			cnt[(p[0]-q[0])*(p[0]-q[0])+(p[1]-q[1])*(p[1]-q[1])]++
+		}
+		for _, v := range cnt {
+			ans += v * (v - 1)
+		}
+	}
+	return ans
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    int numberOfBoomerangs(vector<vector<int>>& points) {
+        int ans = 0;
+        for (const auto& p : points) {
+        unordered_map<int, int> cnt;
+            for (const auto& q : points) {
+                ++cnt[(p[0] - q[0]) * (p[0] - q[0]) + (p[1] - q[1]) * (p[1] - q[1])];
+            }
+            for (const auto& [_, v] : cnt) {
+                ans += v * (v - 1);
+            }
+        }
+        return ans;
+    }
+};
+```
+
 ### **...**
 
 ```

solution/0400-0499/0447.Number of Boomerangs/Solution.cpp

@@ -0,0 +1,16 @@
+class Solution {
+public:
+    int numberOfBoomerangs(vector<vector<int>>& points) {
+        int ans = 0;
+        for (const auto& p : points) {
+        unordered_map<int, int> cnt;
+            for (const auto& q : points) {
+                ++cnt[(p[0] - q[0]) * (p[0] - q[0]) + (p[1] - q[1]) * (p[1] - q[1])];
+            }
+            for (const auto& [_, v] : cnt) {
+                ans += v * (v - 1);
+            }
+        }
+        return ans;
+    }
+};

solution/0400-0499/0447.Number of Boomerangs/Solution.go

@@ -0,0 +1,13 @@
+func numberOfBoomerangs(points [][]int) int {
+	ans := 0
+	for _, p := range points {
+		cnt := make(map[int]int)
+		for _, q := range points {
+			cnt[(p[0]-q[0])*(p[0]-q[0])+(p[1]-q[1])*(p[1]-q[1])]++
+		}
+		for _, v := range cnt {
+			ans += v * (v - 1)
+		}
+	}
+	return ans
+}