Apply cargo clippy --fix

Author: martwz

src/leetcode/contest/biweekly_63.rs

@@ -42,7 +42,7 @@ impl Solution2 {
             }
         }
 
-        return count_aaa > count_bbb;
+        count_aaa > count_bbb
     }
 }
 

src/leetcode/contest/weekly_262.rs

@@ -39,7 +39,7 @@ impl Solution1 {
 // https://leetcode.com/problems/minimum-operations-to-make-a-uni-value-grid/
 impl Solution2 {
     pub fn min_operations(grid: Vec<Vec<i32>>, x: i32) -> i32 {
-        let mut nums = grid.iter().flatten().map(|n| *n).collect::<Vec<i32>>();
+        let mut nums = grid.iter().flatten().copied().collect::<Vec<i32>>();
 
         let min = nums.iter().min().unwrap();
         for i in 0..nums.len() {

src/leetcode/interview/amazon/high_five.rs

@@ -10,10 +10,10 @@ impl Solution {
         let mut ans: Vec<Vec<i32>> = vec![];
         for item in items.iter() {
             let [id, score] = [item[0], item[1]];
-            if five_map.contains_key(&id) {
-                five_map.entry(id).and_modify(|h| h.push(-score));
+            if let std::collections::hash_map::Entry::Vacant(e) = five_map.entry(id) {
+                e.insert(BinaryHeap::from(vec![-score]));
             } else {
-                five_map.insert(id, BinaryHeap::from(vec![-score]));
+                five_map.entry(id).and_modify(|h| h.push(-score));
             }
 
             if five_map.get_mut(&id).unwrap().len() > 5 {

src/leetcode/interview/amazon/minimum_cost.rs

@@ -35,7 +35,7 @@ impl Solution {
             }
         }
 
-        let mut weights = connections.clone(); // [x_i, y_i, cost_i]
+        let mut weights = connections; // [x_i, y_i, cost_i]
         weights.sort_unstable_by(|a, b| a[2].cmp(&b[2]));
 
         let mut costs = 0;

src/leetcode/interview/amazon/search.rs

@@ -7,8 +7,8 @@ impl Solution {
 
         let i = nums.binary_search_by(|p| p.0.cmp(&target));
         match i {
-            Ok(i) => return nums[i].1 as i32,
-            Err(_) => return -1,
+            Ok(i) => nums[i].1 as i32,
+            Err(_) => -1,
         }
     }
 }

src/leetcode/problem/bst_from_preorder.rs

@@ -35,14 +35,14 @@ impl Solution {
             *i += 1;
 
             let root = Rc::new(RefCell::new(TreeNode::new(val)));
-            root.borrow_mut().left = helper(i, &preorder, lower, val);
-            root.borrow_mut().right = helper(i, &preorder, val, upper);
+            root.borrow_mut().left = helper(i, preorder, lower, val);
+            root.borrow_mut().right = helper(i, preorder, val, upper);
 
-            return Some(root);
+            Some(root)
         }
 
         let mut i = 0;
-        return helper(&mut i, &preorder, i32::MIN, i32::MAX);
+        helper(&mut i, &preorder, i32::MIN, i32::MAX)
     }
 }
 

src/leetcode/problem/diameter_of_binary_tree.rs

@@ -32,7 +32,7 @@ impl Solution {
             let path_length = 1 + path_left + path_right;
             *max_path_length = i32::max(*max_path_length, path_length);
 
-            return 1 + i32::max(path_left, path_right);
+            1 + i32::max(path_left, path_right)
         }
 
         let mut max_path_length = 0;

src/leetcode/problem/merge.rs

@@ -7,16 +7,14 @@ impl Solution {
         let mut ans: Vec<Vec<i32>> = vec![];
 
         for interval in intervals.iter_mut() {
-            if ans.len() == 0 {
+            if ans.is_empty() {
                 ans.push(interval.clone());
+            } else if interval[0] >= ans.last().unwrap()[0] && interval[1] <= ans.last().unwrap()[1] {
+                continue;
+            } else if interval[0] <= ans.last().unwrap()[1] {
+                ans.last_mut().unwrap()[1] = interval[1];
             } else {
-                if interval[0] >= ans.last().unwrap()[0] && interval[1] <= ans.last().unwrap()[1] {
-                    continue;
-                } else if interval[0] <= ans.last().unwrap()[1] {
-                    ans.last_mut().unwrap()[1] = interval[1];
-                } else {
-                    ans.push(interval.clone());
-                }
+                ans.push(interval.clone());
             }
         }
 

src/leetcode/problem/rob.rs

@@ -33,7 +33,7 @@ impl Solution {
             }
         }
 
-        i32::max(bfs(root.clone()).0, bfs(root.clone()).1)
+        i32::max(bfs(root.clone()).0, bfs(root).1)
     }
 }
 

src/leetcode/problem/trap.rs

@@ -8,9 +8,9 @@ impl Solution {
         let mut q = VecDeque::<usize>::new();
 
         for (i, h) in height.iter().enumerate() {
-            while q.len() > 0 && height[*q.back().unwrap()] < *h {
+            while !q.is_empty() && height[*q.back().unwrap()] < *h {
                 let top = q.pop_back().unwrap();
-                if q.len() == 0 {
+                if q.is_empty() {
                     break;
                 }