Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
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
Original file line number Diff line number Diff line change
Expand Up @@ -152,6 +152,24 @@ function differenceOfSums(n: number, m: number): number {
}
```

#### Rust

```rust
impl Solution {
pub fn difference_of_sums(n: i32, m: i32) -> i32 {
let mut ans = 0;
for i in 1..=n {
if i % m != 0 {
ans += i;
} else {
ans -= i;
}
}
ans
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -150,6 +150,24 @@ function differenceOfSums(n: number, m: number): number {
}
```

#### Rust

```rust
impl Solution {
pub fn difference_of_sums(n: i32, m: i32) -> i32 {
let mut ans = 0;
for i in 1..=n {
if i % m != 0 {
ans += i;
} else {
ans -= i;
}
}
ans
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
41 changes: 41 additions & 0 deletions solution/3500-3599/3581.Count Odd Letters from Number/README.md
Original file line number Diff line number Diff line change
Expand Up @@ -233,6 +233,47 @@ function bitCount(i: number): number {
}
```

#### Rust

```rust
impl Solution {
pub fn count_odd_letters(mut n: i32) -> i32 {
use std::collections::HashMap;

let d: HashMap<i32, &str> = [
(0, "zero"),
(1, "one"),
(2, "two"),
(3, "three"),
(4, "four"),
(5, "five"),
(6, "six"),
(7, "seven"),
(8, "eight"),
(9, "nine"),
]
.iter()
.cloned()
.collect();

let mut mask: u32 = 0;

while n > 0 {
let x = n % 10;
n /= 10;
if let Some(word) = d.get(&x) {
for c in word.chars() {
let bit = 1 << (c as u8 - b'a');
mask ^= bit as u32;
}
}
}

mask.count_ones() as i32
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
41 changes: 41 additions & 0 deletions solution/3500-3599/3581.Count Odd Letters from Number/README_EN.md
Original file line number Diff line number Diff line change
Expand Up @@ -233,6 +233,47 @@ function bitCount(i: number): number {
}
```

#### Rust

```rust
impl Solution {
pub fn count_odd_letters(mut n: i32) -> i32 {
use std::collections::HashMap;

let d: HashMap<i32, &str> = [
(0, "zero"),
(1, "one"),
(2, "two"),
(3, "three"),
(4, "four"),
(5, "five"),
(6, "six"),
(7, "seven"),
(8, "eight"),
(9, "nine"),
]
.iter()
.cloned()
.collect();

let mut mask: u32 = 0;

while n > 0 {
let x = n % 10;
n /= 10;
if let Some(word) = d.get(&x) {
for c in word.chars() {
let bit = 1 << (c as u8 - b'a');
mask ^= bit as u32;
}
}
}

mask.count_ones() as i32
}
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
36 changes: 36 additions & 0 deletions solution/3500-3599/3581.Count Odd Letters from Number/Solution.rs
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
impl Solution {
pub fn count_odd_letters(mut n: i32) -> i32 {
use std::collections::HashMap;

let d: HashMap<i32, &str> = [
(0, "zero"),
(1, "one"),
(2, "two"),
(3, "three"),
(4, "four"),
(5, "five"),
(6, "six"),
(7, "seven"),
(8, "eight"),
(9, "nine"),
]
.iter()
.cloned()
.collect();

let mut mask: u32 = 0;

while n > 0 {
let x = n % 10;
n /= 10;
if let Some(word) = d.get(&x) {
for c in word.chars() {
let bit = 1 << (c as u8 - b'a');
mask ^= bit as u32;
}
}
}

mask.count_ones() as i32
}
}
Loading