feat: add solutions to lc problem: No.1317

yanglbme · yanglbme · commit e326a8ec7235 · 2022-11-04T22:41:32.000+08:00
No.1317.Convert Integer to the Sum of Two No-Zero Integers
diff --git a/solution/1100-1199/1106.Parsing A Boolean Expression/README.md b/solution/1100-1199/1106.Parsing A Boolean Expression/README.md
@@ -121,12 +121,9 @@ class Solution {
                     stk.pop();
                 }
                 char op = stk.pop();
-                if (op == '!') {
-                    c = f > 0 ? 't' : 'f';
-                } else if (op == '&') {
-                    c = f > 0 ? 'f' : 't';
-                } else {
-                    c = t > 0 ? 't' : 'f';
+                c = 'f';
+                if ((op == '!' && f > 0) || (op == '&' && f == 0) || (op == '|' && t > 0)) {
+                    c = 't';
                 }
                 stk.push(c);
             }
@@ -186,19 +183,8 @@ func parseBoolExpr(expression string) bool {
 			op := stk[len(stk)-1]
 			stk = stk[:len(stk)-1]
 			c = 'f'
-			switch op {
-			case '!':
-				if f > 0 {
-					c = 't'
-				}
-			case '&':
-				if f == 0 {
-					c = 't'
-				}
-			case '|':
-				if t > 0 {
-					c = 't'
-				}
+			if (op == '!' && f > 0) || (op == '&' && f == 0) || (op == '|' && t > 0) {
+				c = 't'
 			}
 			stk = append(stk, c)
 		}
diff --git a/solution/1100-1199/1106.Parsing A Boolean Expression/README_EN.md b/solution/1100-1199/1106.Parsing A Boolean Expression/README_EN.md
@@ -104,12 +104,9 @@ class Solution {
                     stk.pop();
                 }
                 char op = stk.pop();
-                if (op == '!') {
-                    c = f > 0 ? 't' : 'f';
-                } else if (op == '&') {
-                    c = f > 0 ? 'f' : 't';
-                } else {
-                    c = t > 0 ? 't' : 'f';
+                c = 'f';
+                if ((op == '!' && f > 0) || (op == '&' && f == 0) || (op == '|' && t > 0)) {
+                    c = 't';
                 }
                 stk.push(c);
             }
@@ -169,19 +166,8 @@ func parseBoolExpr(expression string) bool {
 			op := stk[len(stk)-1]
 			stk = stk[:len(stk)-1]
 			c = 'f'
-			switch op {
-			case '!':
-				if f > 0 {
-					c = 't'
-				}
-			case '&':
-				if f == 0 {
-					c = 't'
-				}
-			case '|':
-				if t > 0 {
-					c = 't'
-				}
+			if (op == '!' && f > 0) || (op == '&' && f == 0) || (op == '|' && t > 0) {
+				c = 't'
 			}
 			stk = append(stk, c)
 		}
diff --git a/solution/1100-1199/1106.Parsing A Boolean Expression/Solution.go b/solution/1100-1199/1106.Parsing A Boolean Expression/Solution.go
@@ -16,19 +16,8 @@ func parseBoolExpr(expression string) bool {
 			op := stk[len(stk)-1]
 			stk = stk[:len(stk)-1]
 			c = 'f'
-			switch op {
-			case '!':
-				if f > 0 {
-					c = 't'
-				}
-			case '&':
-				if f == 0 {
-					c = 't'
-				}
-			case '|':
-				if t > 0 {
-					c = 't'
-				}
+			if (op == '!' && f > 0) || (op == '&' && f == 0) || (op == '|' && t > 0) {
+				c = 't'
 			}
 			stk = append(stk, c)
 		}
diff --git a/solution/1100-1199/1106.Parsing A Boolean Expression/Solution.java b/solution/1100-1199/1106.Parsing A Boolean Expression/Solution.java
@@ -13,12 +13,9 @@ public boolean parseBoolExpr(String expression) {
                     stk.pop();
                 }
                 char op = stk.pop();
-                if (op == '!') {
-                    c = f > 0 ? 't' : 'f';
-                } else if (op == '&') {
-                    c = f > 0 ? 'f' : 't';
-                } else {
-                    c = t > 0 ? 't' : 'f';
+                c = 'f';
+                if ((op == '!' && f > 0) || (op == '&' && f == 0) || (op == '|' && t > 0)) {
+                    c = 't';
                 }
                 stk.push(c);
             }
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
@@ -64,22 +64,72 @@
 
 <!-- 这里可写通用的实现逻辑 -->
 
+**方法一：直接枚举**
+
+从 $1$ 开始枚举 $a$，判断 $a$ 和 $n - a$ 是否满足条件，如果满足则返回。
+
+时间复杂度 $O(n\times \log n)$。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def getNoZeroIntegers(self, n: int) -> List[int]:
+        for a in range(1, n):
+            b = n - a
+            if "0" not in str(a) + str(b):
+                return [a, b]
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
+class Solution {
+    public int[] getNoZeroIntegers(int n) {
+        for (int a = 1; a < n; ++a) {
+            int b = n - a;
+            if (!(a + "" + b).contains("0")) {
+                return new int[] {a, b};
+            }
+        }
+        return null;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> getNoZeroIntegers(int n) {
+        for (int a = 1; a < n; ++a) {
+            int b = n - a;
+            if ((to_string(a) + to_string(b)).find('0') == string::npos) return {a, b};
+        }
+        return {};
+    }
+};
+```
 
+### **Go**
+
+```go
+func getNoZeroIntegers(n int) []int {
+	for a := 1; a < n; 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/README_EN.md b/solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/README_EN.md
@@ -45,13 +45,57 @@
 ### **Python3**
 
 ```python
-
+class Solution:
+    def getNoZeroIntegers(self, n: int) -> List[int]:
+        for a in range(1, n):
+            b = n - a
+            if "0" not in str(a) + str(b):
+                return [a, b]
 ```
 
 ### **Java**
 
 ```java
+class Solution {
+    public int[] getNoZeroIntegers(int n) {
+        for (int a = 1; a < n; ++a) {
+            int b = n - a;
+            if (!(a + "" + b).contains("0")) {
+                return new int[] {a, b};
+            }
+        }
+        return null;
+    }
+}
+```
+
+### **C++**
+
+```cpp
+class Solution {
+public:
+    vector<int> getNoZeroIntegers(int n) {
+        for (int a = 1; a < n; ++a) {
+            int b = n - a;
+            if ((to_string(a) + to_string(b)).find('0') == string::npos) return {a, b};
+        }
+        return {};
+    }
+};
+```
 
+### **Go**
+
+```go
+func getNoZeroIntegers(n int) []int {
+	for a := 1; a < n; 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.cpp b/solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/Solution.cpp
@@ -0,0 +1,10 @@
+class Solution {
+public:
+    vector<int> getNoZeroIntegers(int n) {
+        for (int a = 1; a < n; ++a) {
+            int b = n - a;
+            if ((to_string(a) + to_string(b)).find('0') == string::npos) 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
@@ -0,0 +1,9 @@
+func getNoZeroIntegers(n int) []int {
+	for a := 1; a < n; 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
@@ -0,0 +1,11 @@
+class Solution {
+    public int[] getNoZeroIntegers(int n) {
+        for (int a = 1; a < n; ++a) {
+            int b = n - a;
+            if (!(a + "" + b).contains("0")) {
+                return new int[] {a, b};
+            }
+        }
+        return null;
+    }
+}
diff --git a/solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/Solution.py b/solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/Solution.py
@@ -0,0 +1,6 @@
+class Solution:
+    def getNoZeroIntegers(self, n: int) -> List[int]:
+        for a in range(1, n):
+            b = n - a
+            if "0" not in str(a) + str(b):
+                return [a, b]

Original file line number	Diff line number	Diff line change
`@@ -13,12 +13,9 @@ public boolean parseBoolExpr(String expression) {`
`13`	`13`	`stk.pop();`
`14`	`14`	`}`
`15`	`15`	`char op = stk.pop();`
`16`		`- if (op == '!') {`
`17`		`- c = f > 0 ? 't' : 'f';`
`18`		`- } else if (op == '&') {`
`19`		`- c = f > 0 ? 'f' : 't';`
`20`		`- } else {`
`21`		`- c = t > 0 ? 't' : 'f';`
	`16`	`+ c = 'f';`
	`17`	`+ if ((op == '!' && f > 0) \|\| (op == '&' && f == 0) \|\| (op == '\|' && t > 0)) {`
	`18`	`+ c = 't';`
`22`	`19`	`}`
`23`	`20`	`stk.push(c);`
`24`	`21`	`}`