feat: add solutions to lc problem: No.1447

No.1447.Simplified Fractions

Author: yanglbme

solution/1400-1499/1447.Simplified Fractions/README.md

@@ -53,15 +53,72 @@
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def simplifiedFractions(self, n: int) -> List[str]:
+        return [f'{i}/{j}' for i in range(1, n) for j in range(i + 1, n + 1) if gcd(i, j) == 1]
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public List<String> simplifiedFractions(int n) {
+        List<String> ans = new ArrayList<>();
+        for (int i = 1; i < n; ++i) {
+            for (int j = i + 1; j < n + 1; ++j) {
+                if (gcd(i, j) == 1) {
+                    ans.add(i + "/" + j);
+                }
+            }
+        }
+        return ans;
+    }
+
+    private int gcd(int a, int b) {
+        return b > 0 ? gcd(b, a % b) : a;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<string> simplifiedFractions(int n) {
+        vector<string> ans;
+        for (int i = 1; i < n; ++i)
+            for (int j = i + 1; j < n + 1; ++j)
+                if (gcd(i, j) == 1)
+                    ans.push_back(to_string(i) + "/" + to_string(j));
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func simplifiedFractions(n int) []string {
+	var ans []string
+	for i := 1; i < n; i++ {
+		for j := i + 1; j < n+1; j++ {
+			if gcd(i, j) == 1 {
+				ans = append(ans, strconv.Itoa(i)+"/"+strconv.Itoa(j))
+			}
+		}
+	}
+	return ans
+}
+
+func gcd(a, b int) int {
+	if b <= 0 {
+		return a
+	}
+	return gcd(b, a%b)
+}
 ```
 
 ### **...**

solution/1400-1499/1447.Simplified Fractions/README_EN.md

@@ -63,13 +63,70 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def simplifiedFractions(self, n: int) -> List[str]:
+        return [f'{i}/{j}' for i in range(1, n) for j in range(i + 1, n + 1) if gcd(i, j) == 1]
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public List<String> simplifiedFractions(int n) {
+        List<String> ans = new ArrayList<>();
+        for (int i = 1; i < n; ++i) {
+            for (int j = i + 1; j < n + 1; ++j) {
+                if (gcd(i, j) == 1) {
+                    ans.add(i + "/" + j);
+                }
+            }
+        }
+        return ans;
+    }
+
+    private int gcd(int a, int b) {
+        return b > 0 ? gcd(b, a % b) : a;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<string> simplifiedFractions(int n) {
+        vector<string> ans;
+        for (int i = 1; i < n; ++i)
+            for (int j = i + 1; j < n + 1; ++j)
+                if (gcd(i, j) == 1)
+                    ans.push_back(to_string(i) + "/" + to_string(j));
+        return ans;
+    }
+};
+```
 
+### **Go**
+
+```go
+func simplifiedFractions(n int) []string {
+	var ans []string
+	for i := 1; i < n; i++ {
+		for j := i + 1; j < n+1; j++ {
+			if gcd(i, j) == 1 {
+				ans = append(ans, strconv.Itoa(i)+"/"+strconv.Itoa(j))
+			}
+		}
+	}
+	return ans
+}
+
+func gcd(a, b int) int {
+	if b <= 0 {
+		return a
+	}
+	return gcd(b, a%b)
+}
 ```
 
 ### **...**

solution/1400-1499/1447.Simplified Fractions/Solution.cpp

@@ -0,0 +1,11 @@
+class Solution {
+public:
+    vector<string> simplifiedFractions(int n) {
+        vector<string> ans;
+        for (int i = 1; i < n; ++i)
+            for (int j = i + 1; j < n + 1; ++j)
+                if (gcd(i, j) == 1)
+                    ans.push_back(to_string(i) + "/" + to_string(j));
+        return ans;
+    }
+};

solution/1400-1499/1447.Simplified Fractions/Solution.go

@@ -0,0 +1,18 @@
+func simplifiedFractions(n int) []string {
+	var ans []string
+	for i := 1; i < n; i++ {
+		for j := i + 1; j < n+1; j++ {
+			if gcd(i, j) == 1 {
+				ans = append(ans, strconv.Itoa(i)+"/"+strconv.Itoa(j))
+			}
+		}
+	}
+	return ans
+}
+
+func gcd(a, b int) int {
+	if b <= 0 {
+		return a
+	}
+	return gcd(b, a%b)
+}

solution/1400-1499/1447.Simplified Fractions/Solution.java

@@ -0,0 +1,17 @@
+class Solution {
+    public List<String> simplifiedFractions(int n) {
+        List<String> ans = new ArrayList<>();
+        for (int i = 1; i < n; ++i) {
+            for (int j = i + 1; j < n + 1; ++j) {
+                if (gcd(i, j) == 1) {
+                    ans.add(i + "/" + j);
+                }
+            }
+        }
+        return ans;
+    }
+
+    private int gcd(int a, int b) {
+        return b > 0 ? gcd(b, a % b) : a;
+    } 
+}

solution/1400-1499/1447.Simplified Fractions/Solution.py

@@ -0,0 +1,3 @@
+class Solution:
+    def simplifiedFractions(self, n: int) -> List[str]:
+        return [f'{i}/{j}' for i in range(1, n) for j in range(i + 1, n + 1) if gcd(i, j) == 1]