Fix Clippy warnings

EFanZh · Jun 22, 2024 · ef563c5 · ef563c5
1 parent 3ebf52e
commit ef563c5
Show file tree

Hide file tree

Showing 5 changed files with 8 additions and 8 deletions.
diff --git a/src/problem_0553_optimal_division/dynamic_programming.rs b/src/problem_0553_optimal_division/dynamic_programming.rs
@@ -56,9 +56,9 @@ impl Solution {
             let (top, row) = cache[..n * (length - 1) + (n + 1 - length)].split_at_mut(n * (length - 1));
 
             for (start, slot) in row.iter_mut().enumerate() {
-                let mut min = std::f64::INFINITY;
+                let mut min = f64::INFINITY;
                 let mut min_left_length = 0;
-                let mut max = std::f64::NEG_INFINITY;
+                let mut max = f64::NEG_INFINITY;
                 let mut max_left_length = 0;
 
                 for left_length in 1..length {

diff --git a/src/problem_0952_largest_component_size_by_common_factor/union_find.rs b/src/problem_0952_largest_component_size_by_common_factor/union_find.rs
@@ -25,10 +25,10 @@ impl Solution {
                 if value % prime == 0 {
                     f(prime.get());
 
-                    value = value / prime;
+                    value /= prime;
 
                     while value % prime == 0 {
-                        value = value / prime;
+                        value /= prime;
                     }
                 }
             } else {

diff --git a/src/problem_0964_least_operators_to_express_number/dynamic_programming.rs b/src/problem_0964_least_operators_to_express_number/dynamic_programming.rs
@@ -14,7 +14,7 @@ impl Solution {
         let mut base = 1;
 
         loop {
-            target = target / x;
+            target /= x;
 
             if target == 0 {
                 break;

diff --git a/...blem_1815_maximum_number_of_groups_getting_fresh_donuts/greedy_and_dynamic_programming.rs b/...blem_1815_maximum_number_of_groups_getting_fresh_donuts/greedy_and_dynamic_programming.rs
@@ -70,7 +70,7 @@ impl Solution {
 
                 for (group_size, &count) in (1..).zip(&group_states[..usize::from(batch_size.get()) - 1]) {
                     total_count += group_size * (x % count);
-                    x = x / count;
+                    x /= count;
                 }
 
                 (total_count % batch_size) as u8
@@ -86,7 +86,7 @@ impl Solution {
                             max_count.max(cache[usize::from(state - base.get())] + u8::from(last_group == total_count));
                     }
 
-                    state_iter = state_iter / count;
+                    state_iter /= count;
                 }
 
                 max_count

diff --git a/src/problem_1837_sum_of_digits_in_base_k/iterative.rs b/src/problem_1837_sum_of_digits_in_base_k/iterative.rs
@@ -12,7 +12,7 @@ impl Solution {
 
         while n != 0 {
             result += n % k;
-            n = n / k;
+            n /= k;
         }
 
         i32::from(result)