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
5 changes: 4 additions & 1 deletion README.md
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
# leetcode

当前已刷:237
当前已刷:238

### 题目
- 1:两数之和
Expand Down Expand Up @@ -438,6 +438,9 @@
- 263:丑数
- [src](https://github.com/rustors/leetcode/blob/main/src/bin/ugly-number.rs)
- [leetcode](https://leetcode-cn.com/problems/ugly-number/)
- 268:丢失的数字
- [src](https://github.com/rustors/leetcode/blob/main/src/bin/missing-number.rs)
- [leetcode](https://leetcode-cn.com/problems/missing-number/)
- 290:单词规律
- [src](https://github.com/rustors/leetcode/blob/main/src/bin/word-pattern.rs)
- [leetcode](https://leetcode-cn.com/problems/word-pattern/)
Expand Down
19 changes: 19 additions & 0 deletions src/bin/missing-number.rs
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
fn main() {
println!("{}", Solution::missing_number1(vec![3, 0, 1]));
println!("{}", Solution::missing_number1(vec![9, 6, 4, 2, 3, 5, 7, 0, 1]));
}

struct Solution;

impl Solution {
pub fn missing_number(nums: Vec<i32>) -> i32 {
(0..=nums.len() as i32).sum::<i32>() - nums.into_iter().sum::<i32>()
}

pub fn missing_number1(nums: Vec<i32>) -> i32 {
let l = nums.len() as i32;
nums.into_iter().enumerate().fold(l, |l, (x, y)| {
x as i32 ^ y ^ l
})
}
}