Apply cargo clippy --fix

Author: martwz

src/leetcode/problem/can_complete_circuit.rs

@@ -25,7 +25,7 @@ impl Solution {
             }
         }
 
-        return -1;
+        -1
     }
 }
 

src/leetcode/problem/coin_change.rs

@@ -2,7 +2,7 @@
 // https://leetcode.com/problems/coin-change/
 impl Solution {
     pub fn coin_change(coins: Vec<i32>, amount: i32) -> i32 {
-        let n = coins.len();
+        let _n = coins.len();
         let mut dp = vec![amount + 1; amount as usize + 1];
 
         dp[0] = 0;

src/leetcode/problem/is_same_tree.rs

@@ -25,11 +25,7 @@ impl Solution {
                 }
 
                 return bfs(node1.borrow().left.clone(), node2.borrow().left.clone()) && bfs(node1.borrow().right.clone(), node2.borrow().right.clone());
-            } else if node1.is_none() && node2.is_none() {
-                return true;
-            } else {
-                return false;
-            }
+            } else { node1.is_none() && node2.is_none() }
         }
 
         bfs(p, q)

src/leetcode/problem/unique_paths.rs

@@ -15,7 +15,7 @@ impl Solution {
             }
         }
 
-        return dp[n - 1][m - 1];
+        dp[n - 1][m - 1]
     }
 }
 

src/leetcode/top_interview/dynamic_programming/can_jump.rs

@@ -8,19 +8,19 @@ impl Solution {
         let mut pos: VecDeque<usize> = VecDeque::new();
         pos.push_back(0);
 
-        while pos.len() > 0 && pos.back().unwrap() < &n {
+        while !pos.is_empty() && pos.back().unwrap() < &n {
             let curr = *pos.back().unwrap();
             let next = nums[curr] as usize;
 
             if next == 0 {
-                &pos.pop_back();
+                pos.pop_back();
             } else {
                 nums[curr] -= 1;
                 pos.push_back(curr + next);
             }
         }
 
-        pos.len() > 0 && pos.back().unwrap() >= &n
+        !pos.is_empty() && pos.back().unwrap() >= &n
     }
 }