Skip to content

feat: add solutions to lc problem: No.1317 #4704

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Sep 7, 2025
Merged

feat: add solutions to lc problem: No.1317 #4704

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
50 changes: 46 additions & 4 deletions ...ion/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -96,9 +96,9 @@ tags:
```python
class Solution:
def getNoZeroIntegers(self, n: int) -> List[int]:
for a in range(1, n):
for a in count(1):
b = n - a
if "0" not in str(a) + str(b):
if "0" not in f"{a}{b}":
return [a, b]
```

Expand Down Expand Up @@ -159,6 +159,22 @@ function getNoZeroIntegers(n: number): number[] {
}
```

#### Rust

```rust
impl Solution {
pub fn get_no_zero_integers(n: i32) -> Vec<i32> {
for a in 1..n {
let b = n - a;
if !a.to_string().contains('0') && !b.to_string().contains('0') {
return vec![a, b];
}
}
vec![]
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand All @@ -178,14 +194,14 @@ function getNoZeroIntegers(n: number): number[] {
```python
class Solution:
def getNoZeroIntegers(self, n: int) -> List[int]:
def f(x):
def f(x: int) -> bool:
while x:
if x % 10 == 0:
return False
x //= 10
return True

for a in range(1, n):
for a in count(1):
b = n - a
if f(a) and f(b):
return [a, b]
Expand Down Expand Up @@ -281,6 +297,32 @@ function getNoZeroIntegers(n: number): number[] {
}
```

#### Rust

```rust
impl Solution {
pub fn get_no_zero_integers(n: i32) -> Vec<i32> {
fn f(mut x: i32) -> bool {
while x > 0 {
if x % 10 == 0 {
return false;
}
x /= 10;
}
true
}

for a in 1..n {
let b = n - a;
if f(a) && f(b) {
return vec![a, b];
}
}
vec![]
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
50 changes: 46 additions & 4 deletions .../1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -75,9 +75,9 @@ The time complexity is $O(n \times \log n)$, where $n$ is the integer given in t
```python
class Solution:
def getNoZeroIntegers(self, n: int) -> List[int]:
for a in range(1, n):
for a in count(1):
b = n - a
if "0" not in str(a) + str(b):
if "0" not in f"{a}{b}":
return [a, b]
```

Expand Down Expand Up @@ -138,6 +138,22 @@ function getNoZeroIntegers(n: number): number[] {
}
```

#### Rust

```rust
impl Solution {
pub fn get_no_zero_integers(n: i32) -> Vec<i32> {
for a in 1..n {
let b = n - a;
if !a.to_string().contains('0') && !b.to_string().contains('0') {
return vec![a, b];
}
}
vec![]
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand All @@ -157,14 +173,14 @@ The time complexity is $O(n \times \log n)$, where $n$ is the integer given in t
```python
class Solution:
def getNoZeroIntegers(self, n: int) -> List[int]:
def f(x):
def f(x: int) -> bool:
while x:
if x % 10 == 0:
return False
x //= 10
return True

for a in range(1, n):
for a in count(1):
b = n - a
if f(a) and f(b):
return [a, b]
Expand Down Expand Up @@ -260,6 +276,32 @@ function getNoZeroIntegers(n: number): number[] {
}
```

#### Rust

```rust
impl Solution {
pub fn get_no_zero_integers(n: i32) -> Vec<i32> {
fn f(mut x: i32) -> bool {
while x > 0 {
if x % 10 == 0 {
return false;
}
x /= 10;
}
true
}

for a in 1..n {
let b = n - a;
if f(a) && f(b) {
return vec![a, b];
}
}
vec![]
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
4 changes: 2 additions & 2 deletions solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/Solution.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
class Solution:
def getNoZeroIntegers(self, n: int) -> List[int]:
for a in range(1, n):
for a in count(1):
b = n - a
if "0" not in str(a) + str(b):
if "0" not in f"{a}{b}":
return [a, b]
11 changes: 11 additions & 0 deletions solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/Solution.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
impl Solution {
pub fn get_no_zero_integers(n: i32) -> Vec<i32> {
for a in 1..n {
let b = n - a;
if !a.to_string().contains('0') && !b.to_string().contains('0') {
return vec![a, b];
}
}
vec![]
}
}
4 changes: 2 additions & 2 deletions solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/Solution2.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,13 +1,13 @@
class Solution:
def getNoZeroIntegers(self, n: int) -> List[int]:
def f(x):
def f(x: int) -> bool:
while x:
if x % 10 == 0:
return False
x //= 10
return True

for a in range(1, n):
for a in count(1):
b = n - a
if f(a) and f(b):
return [a, b]
21 changes: 21 additions & 0 deletions solution/1300-1399/1317.Convert Integer to the Sum of Two No-Zero Integers/Solution2.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
impl Solution {
pub fn get_no_zero_integers(n: i32) -> Vec<i32> {
fn f(mut x: i32) -> bool {
while x > 0 {
if x % 10 == 0 {
return false;
}
x /= 10;
}
true
}

for a in 1..n {
let b = n - a;
if f(a) && f(b) {
return vec![a, b];
}
}
vec![]
}
}