feat: add solutions to lc problem: No.1317

yanglbme · yanglbme · commit d37b072c5037 · 2023-02-21T16:14:57.000+08:00
No.1317.Convert Integer to the Sum of Two No-Zero Integers
diff --git a/solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/README.md b/solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/README.md
@@ -68,7 +68,7 @@
 
 从 $1$ 开始枚举 $a$，判断 $a$ 和 $n - a$ 是否满足条件，如果满足则返回。
 
-时间复杂度 $O(n\times \log n)$。
+时间复杂度 $O(n\times \log n)$，空间复杂度 $O(1)$。其中 $n$ 为题目给定的整数。
 
 <!-- tabs:start -->
 
@@ -85,20 +85,57 @@ class Solution:
                 return [a, b]
 ```
 
+```python
+class Solution:
+    def getNoZeroIntegers(self, n: int) -> List[int]:
+        def f(x):
+            while x:
+                if x % 10 == 0:
+                    return False
+                x //= 10
+            return True
+        
+        for a in range(1, n):
+            b = n - a
+            if f(a) and f(b):
+                return [a, b]
+```
+
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
 class Solution {
     public int[] getNoZeroIntegers(int n) {
-        for (int a = 1; a < n; ++a) {
+        for (int a = 1; ; ++a) {
             int b = n - a;
             if (!(a + "" + b).contains("0")) {
                 return new int[] {a, b};
             }
         }
-        return null;
+    }
+}
+```
+
+```java
+class Solution {
+    public int[] getNoZeroIntegers(int n) {
+        for (int a = 1; ; ++a) {
+            int b = n - a;
+            if (f(a) && f(b)) {
+                return new int[] {a, b};
+            }
+        }
+    }
+
+    private boolean f(int x) {
+        for (; x > 0; x /= 10) {
+            if (x % 10 == 0) {
+                return false;
+            }
+        }
+        return true;
     }
 }
 ```
@@ -109,11 +146,34 @@ class Solution {
 class Solution {
 public:
     vector<int> getNoZeroIntegers(int n) {
-        for (int a = 1; a < n; ++a) {
+        for (int a = 1; ; ++a) {
             int b = n - a;
-            if ((to_string(a) + to_string(b)).find('0') == string::npos) return {a, b};
+            if ((to_string(a) + to_string(b)).find('0') == -1) {
+                return {a, b};
+            }
+        }
+    }
+};
+```
+
+```cpp
+class Solution {
+public:
+    vector<int> getNoZeroIntegers(int n) {
+        auto f = [](int x) {
+            for (; x; x /= 10) {
+                if (x % 10 == 0) {
+                    return false;
+                }
+            }
+            return true;
+        };
+        for (int a = 1; ; ++a) {
+            int b = n - a;
+            if (f(a) && f(b)) {
+                return {a, b};
+            }
         }
-        return {};
     }
 };
 ```
@@ -122,13 +182,31 @@ public:
 
 ```go
 func getNoZeroIntegers(n int) []int {
-	for a := 1; a < n; a++ {
+	for a := 1; ; a++ {
 		b := n - a
 		if !strings.Contains(strconv.Itoa(a)+strconv.Itoa(b), "0") {
 			return []int{a, b}
 		}
 	}
-	return nil
+}
+```
+
+```go
+func getNoZeroIntegers(n int) []int {
+	f := func(x int) bool {
+		for ; x > 0; x /= 10 {
+			if x%10 == 0 {
+				return false
+			}
+		}
+		return true
+	}
+	for a := 1; ; a++ {
+		b := n - a
+		if f(a) && f(b) {
+			return []int{a, b}
+		}
+	}
 }
 ```
 
diff --git a/solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/README_EN.md b/solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/README_EN.md
@@ -57,18 +57,55 @@ class Solution:
                 return [a, b]
 ```
 
+```python
+class Solution:
+    def getNoZeroIntegers(self, n: int) -> List[int]:
+        def f(x):
+            while x:
+                if x % 10 == 0:
+                    return False
+                x //= 10
+            return True
+        
+        for a in range(1, n):
+            b = n - a
+            if f(a) and f(b):
+                return [a, b]
+```
+
 ### **Java**
 
 ```java
 class Solution {
     public int[] getNoZeroIntegers(int n) {
-        for (int a = 1; a < n; ++a) {
+        for (int a = 1; ; ++a) {
             int b = n - a;
             if (!(a + "" + b).contains("0")) {
                 return new int[] {a, b};
             }
         }
-        return null;
+    }
+}
+```
+
+```java
+class Solution {
+    public int[] getNoZeroIntegers(int n) {
+        for (int a = 1; ; ++a) {
+            int b = n - a;
+            if (f(a) && f(b)) {
+                return new int[] {a, b};
+            }
+        }
+    }
+
+    private boolean f(int x) {
+        for (; x > 0; x /= 10) {
+            if (x % 10 == 0) {
+                return false;
+            }
+        }
+        return true;
     }
 }
 ```
@@ -79,11 +116,34 @@ class Solution {
 class Solution {
 public:
     vector<int> getNoZeroIntegers(int n) {
-        for (int a = 1; a < n; ++a) {
+        for (int a = 1; ; ++a) {
             int b = n - a;
-            if ((to_string(a) + to_string(b)).find('0') == string::npos) return {a, b};
+            if ((to_string(a) + to_string(b)).find('0') == -1) {
+                return {a, b};
+            }
+        }
+    }
+};
+```
+
+```cpp
+class Solution {
+public:
+    vector<int> getNoZeroIntegers(int n) {
+        auto f = [](int x) {
+            for (; x; x /= 10) {
+                if (x % 10 == 0) {
+                    return false;
+                }
+            }
+            return true;
+        };
+        for (int a = 1; ; ++a) {
+            int b = n - a;
+            if (f(a) && f(b)) {
+                return {a, b};
+            }
         }
-        return {};
     }
 };
 ```
@@ -92,13 +152,31 @@ public:
 
 ```go
 func getNoZeroIntegers(n int) []int {
-	for a := 1; a < n; a++ {
+	for a := 1; ; a++ {
 		b := n - a
 		if !strings.Contains(strconv.Itoa(a)+strconv.Itoa(b), "0") {
 			return []int{a, b}
 		}
 	}
-	return nil
+}
+```
+
+```go
+func getNoZeroIntegers(n int) []int {
+	f := func(x int) bool {
+		for ; x > 0; x /= 10 {
+			if x%10 == 0 {
+				return false
+			}
+		}
+		return true
+	}
+	for a := 1; ; a++ {
+		b := n - a
+		if f(a) && f(b) {
+			return []int{a, b}
+		}
+	}
 }
 ```
 
diff --git a/solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/Solution.cpp b/solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/Solution.cpp
@@ -1,10 +1,11 @@
 class Solution {
 public:
     vector<int> getNoZeroIntegers(int n) {
-        for (int a = 1; a < n; ++a) {
+        for (int a = 1; ; ++a) {
             int b = n - a;
-            if ((to_string(a) + to_string(b)).find('0') == string::npos) return {a, b};
+            if ((to_string(a) + to_string(b)).find('0') == -1) {
+                return {a, b};
+            }
         }
-        return {};
     }
 };
diff --git a/solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/Solution.go b/solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/Solution.go
@@ -1,9 +1,8 @@
 func getNoZeroIntegers(n int) []int {
-	for a := 1; a < n; a++ {
+	for a := 1; ; a++ {
 		b := n - a
 		if !strings.Contains(strconv.Itoa(a)+strconv.Itoa(b), "0") {
 			return []int{a, b}
 		}
 	}
-	return nil
 }
diff --git a/solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/Solution.java b/solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/Solution.java
@@ -1,11 +1,10 @@
 class Solution {
     public int[] getNoZeroIntegers(int n) {
-        for (int a = 1; a < n; ++a) {
+        for (int a = 1; ; ++a) {
             int b = n - a;
             if (!(a + "" + b).contains("0")) {
                 return new int[] {a, b};
             }
         }
-        return null;
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -1,9 +1,8 @@`
`1`	`1`	`func getNoZeroIntegers(n int) []int {`
`2`		`- for a := 1; a < n; a++ {`
	`2`	`+ for a := 1; ; a++ {`
`3`	`3`	`b := n - a`
`4`	`4`	`if !strings.Contains(strconv.Itoa(a)+strconv.Itoa(b), "0") {`
`5`	`5`	`return []int{a, b}`
`6`	`6`	`}`
`7`	`7`	`}`
`8`		`- return nil`
`9`	`8`	`}`
Original file line number	Diff line number	Diff line change
`@@ -1,11 +1,10 @@`
`1`	`1`	`class Solution {`
`2`	`2`	`public int[] getNoZeroIntegers(int n) {`
`3`		`- for (int a = 1; a < n; ++a) {`
	`3`	`+ for (int a = 1; ; ++a) {`
`4`	`4`	`int b = n - a;`
`5`	`5`	`if (!(a + "" + b).contains("0")) {`
`6`	`6`	`return new int[] {a, b};`
`7`	`7`	`}`
`8`	`8`	`}`
`9`		`- return null;`
`10`	`9`	`}`
`11`	`10`	`}`