Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit f8a7d65

Browse files
committed
Apply cargo clippy --fix
1 parent a378e5d commit f8a7d65

File tree

5 files changed

+7
-11
lines changed

5 files changed

+7
-11
lines changed

‎src/leetcode/problem/can_complete_circuit.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -25,7 +25,7 @@ impl Solution {
2525
}
2626
}
2727

28-
return -1;
28+
-1
2929
}
3030
}
3131

‎src/leetcode/problem/coin_change.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -2,7 +2,7 @@
22
// https://leetcode.com/problems/coin-change/
33
impl Solution {
44
pub fn coin_change(coins: Vec<i32>, amount: i32) -> i32 {
5-
let n = coins.len();
5+
let _n = coins.len();
66
let mut dp = vec![amount + 1; amount as usize + 1];
77

88
dp[0] = 0;

‎src/leetcode/problem/is_same_tree.rs

Lines changed: 1 addition & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -25,11 +25,7 @@ impl Solution {
2525
}
2626

2727
return bfs(node1.borrow().left.clone(), node2.borrow().left.clone()) && bfs(node1.borrow().right.clone(), node2.borrow().right.clone());
28-
} else if node1.is_none() && node2.is_none() {
29-
return true;
30-
} else {
31-
return false;
32-
}
28+
} else { node1.is_none() && node2.is_none() }
3329
}
3430

3531
bfs(p, q)

‎src/leetcode/problem/unique_paths.rs

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -15,7 +15,7 @@ impl Solution {
1515
}
1616
}
1717

18-
returndp[n - 1][m - 1];
18+
dp[n - 1][m - 1]
1919
}
2020
}
2121

‎src/leetcode/top_interview/dynamic_programming/can_jump.rs

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -8,19 +8,19 @@ impl Solution {
88
let mut pos: VecDeque<usize> = VecDeque::new();
99
pos.push_back(0);
1010

11-
while pos.len() > 0 && pos.back().unwrap() < &n {
11+
while !pos.is_empty() && pos.back().unwrap() < &n {
1212
let curr = *pos.back().unwrap();
1313
let next = nums[curr] as usize;
1414

1515
if next == 0 {
16-
&pos.pop_back();
16+
pos.pop_back();
1717
} else {
1818
nums[curr] -= 1;
1919
pos.push_back(curr + next);
2020
}
2121
}
2222

23-
pos.len() > 0 && pos.back().unwrap() >= &n
23+
!pos.is_empty() && pos.back().unwrap() >= &n
2424
}
2525
}
2626

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /