diff --git a/src/problem_0004_median_of_two_sorted_arrays/mod.rs b/src/problem_0004_median_of_two_sorted_arrays/mod.rs index 1b1ed19ab..64166a287 100644 --- a/src/problem_0004_median_of_two_sorted_arrays/mod.rs +++ b/src/problem_0004_median_of_two_sorted_arrays/mod.rs @@ -25,7 +25,7 @@ mod tests { ]; for ((nums1, nums2), expected) in test_cases { - approx::assert_ulps_eq!(S::find_median_sorted_arrays(nums1.to_vec(), nums2.to_vec()), expected,); + approx::assert_ulps_eq!(S::find_median_sorted_arrays(nums1.to_vec(), nums2.to_vec()), expected); } } } diff --git a/src/problem_0354_russian_doll_envelopes/mod.rs b/src/problem_0354_russian_doll_envelopes/mod.rs index 6e589223c..092f16e85 100644 --- a/src/problem_0354_russian_doll_envelopes/mod.rs +++ b/src/problem_0354_russian_doll_envelopes/mod.rs @@ -16,10 +16,7 @@ mod tests { ]; for (envelopes, expected) in test_cases { - assert_eq!( - S::max_envelopes(envelopes.iter().copied().map(Vec::from).collect()), - expected - ); + assert_eq!(S::max_envelopes(envelopes.iter().map(Vec::from).collect()), expected); } } } diff --git a/src/problem_0435_non_overlapping_intervals/mod.rs b/src/problem_0435_non_overlapping_intervals/mod.rs index 734949b94..665ef123d 100644 --- a/src/problem_0435_non_overlapping_intervals/mod.rs +++ b/src/problem_0435_non_overlapping_intervals/mod.rs @@ -17,7 +17,7 @@ mod tests { for (intervals, expected) in test_cases { assert_eq!( - S::erase_overlap_intervals(intervals.iter().copied().map(Vec::from).collect()), + S::erase_overlap_intervals(intervals.iter().map(Vec::from).collect()), expected ); } diff --git a/src/problem_0436_find_right_interval/mod.rs b/src/problem_0436_find_right_interval/mod.rs index 76bf3daa1..c174915d1 100644 --- a/src/problem_0436_find_right_interval/mod.rs +++ b/src/problem_0436_find_right_interval/mod.rs @@ -19,7 +19,7 @@ mod tests { for (intervals, expected) in test_cases { assert_eq!( - S::find_right_interval(intervals.iter().copied().map(Vec::from).collect()), + S::find_right_interval(intervals.iter().map(Vec::from).collect()), expected ); } diff --git a/src/problem_0447_number_of_boomerangs/mod.rs b/src/problem_0447_number_of_boomerangs/mod.rs index 3ec0102fe..eaf3db77f 100644 --- a/src/problem_0447_number_of_boomerangs/mod.rs +++ b/src/problem_0447_number_of_boomerangs/mod.rs @@ -18,7 +18,7 @@ mod tests { for (points, expected) in test_cases { assert_eq!( - S::number_of_boomerangs(points.iter().copied().map(Vec::from).collect()), + S::number_of_boomerangs(points.iter().map(Vec::from).collect()), expected ); } diff --git a/src/problem_0452_minimum_number_of_arrows_to_burst_balloons/mod.rs b/src/problem_0452_minimum_number_of_arrows_to_burst_balloons/mod.rs index 4ebf50a58..00ac6b355 100644 --- a/src/problem_0452_minimum_number_of_arrows_to_burst_balloons/mod.rs +++ b/src/problem_0452_minimum_number_of_arrows_to_burst_balloons/mod.rs @@ -19,7 +19,7 @@ mod tests { for (points, expected) in test_cases { assert_eq!( - S::find_min_arrow_shots(points.iter().copied().map(Vec::from).collect()), + S::find_min_arrow_shots(points.iter().map(Vec::from).collect()), expected ); } diff --git a/src/problem_0587_erect_the_fence/mod.rs b/src/problem_0587_erect_the_fence/mod.rs index 5493f9726..02766f4d1 100644 --- a/src/problem_0587_erect_the_fence/mod.rs +++ b/src/problem_0587_erect_the_fence/mod.rs @@ -64,7 +64,7 @@ mod tests { for (points, expected) in test_cases { assert_eq!( - test_utilities::unstable_sorted(S::outer_trees(points.iter().copied().map(Vec::from).collect())), + test_utilities::unstable_sorted(S::outer_trees(points.iter().map(Vec::from).collect())), expected ); } diff --git a/src/problem_0598_range_addition_ii/mod.rs b/src/problem_0598_range_addition_ii/mod.rs index 5fa67f357..dae8114e3 100644 --- a/src/problem_0598_range_addition_ii/mod.rs +++ b/src/problem_0598_range_addition_ii/mod.rs @@ -36,10 +36,7 @@ mod tests { ]; for ((m, n, ops), expected) in test_cases { - assert_eq!( - S::max_count(m, n, ops.iter().copied().map(Vec::from).collect()), - expected - ); + assert_eq!(S::max_count(m, n, ops.iter().map(Vec::from).collect()), expected); } } } diff --git a/src/problem_0630_course_schedule_iii/mod.rs b/src/problem_0630_course_schedule_iii/mod.rs index 5a7e37881..5f4d322cc 100644 --- a/src/problem_0630_course_schedule_iii/mod.rs +++ b/src/problem_0630_course_schedule_iii/mod.rs @@ -18,10 +18,7 @@ mod tests { ]; for (courses, expected) in test_cases { - assert_eq!( - S::schedule_course(courses.iter().copied().map(Vec::from).collect()), - expected - ); + assert_eq!(S::schedule_course(courses.iter().map(Vec::from).collect()), expected); } } } diff --git a/src/problem_0646_maximum_length_of_pair_chain/mod.rs b/src/problem_0646_maximum_length_of_pair_chain/mod.rs index a01011a76..3503ff069 100644 --- a/src/problem_0646_maximum_length_of_pair_chain/mod.rs +++ b/src/problem_0646_maximum_length_of_pair_chain/mod.rs @@ -19,10 +19,7 @@ mod tests { ]; for (pairs, expected) in test_cases { - assert_eq!( - S::find_longest_chain(pairs.iter().copied().map(Vec::from).collect()), - expected - ); + assert_eq!(S::find_longest_chain(pairs.iter().map(Vec::from).collect()), expected); } } } diff --git a/src/problem_0684_redundant_connection/mod.rs b/src/problem_0684_redundant_connection/mod.rs index eaafcdc90..2a79f40ff 100644 --- a/src/problem_0684_redundant_connection/mod.rs +++ b/src/problem_0684_redundant_connection/mod.rs @@ -17,7 +17,7 @@ mod tests { for (edges, expected) in test_cases { assert_eq!( - S::find_redundant_connection(edges.iter().copied().map(Vec::from).collect()), + S::find_redundant_connection(edges.iter().map(Vec::from).collect()), expected ); } diff --git a/src/problem_0685_redundant_connection_ii/mod.rs b/src/problem_0685_redundant_connection_ii/mod.rs index 15fddb88a..0ad873e6b 100644 --- a/src/problem_0685_redundant_connection_ii/mod.rs +++ b/src/problem_0685_redundant_connection_ii/mod.rs @@ -17,7 +17,7 @@ mod tests { for (edges, expected) in test_cases { assert_eq!( - S::find_redundant_directed_connection(edges.iter().copied().map(Vec::from).collect()), + S::find_redundant_directed_connection(edges.iter().map(Vec::from).collect()), expected ); } diff --git a/src/problem_0699_falling_squares/mod.rs b/src/problem_0699_falling_squares/mod.rs index 66a97ad55..e7ded36c0 100644 --- a/src/problem_0699_falling_squares/mod.rs +++ b/src/problem_0699_falling_squares/mod.rs @@ -20,10 +20,7 @@ mod tests { ]; for (positions, expected) in test_cases { - assert_eq!( - S::falling_squares(positions.iter().copied().map(Vec::from).collect()), - expected - ); + assert_eq!(S::falling_squares(positions.iter().map(Vec::from).collect()), expected); } } } diff --git a/src/problem_0757_set_intersection_size_at_least_two/mod.rs b/src/problem_0757_set_intersection_size_at_least_two/mod.rs index 3db9acf82..ba81b417c 100644 --- a/src/problem_0757_set_intersection_size_at_least_two/mod.rs +++ b/src/problem_0757_set_intersection_size_at_least_two/mod.rs @@ -17,7 +17,7 @@ mod tests { for (intervals, expected) in test_cases { assert_eq!( - S::intersection_size_two(intervals.iter().copied().map(Vec::from).collect()), + S::intersection_size_two(intervals.iter().map(Vec::from).collect()), expected ); } diff --git a/src/problem_1385_find_the_distance_value_between_two_arrays/mod.rs b/src/problem_1385_find_the_distance_value_between_two_arrays/mod.rs index 11c2c8547..b9f783bc1 100644 --- a/src/problem_1385_find_the_distance_value_between_two_arrays/mod.rs +++ b/src/problem_1385_find_the_distance_value_between_two_arrays/mod.rs @@ -17,7 +17,7 @@ mod tests { ]; for ((arr1, arr2, d), expected) in test_cases { - assert_eq!(S::find_the_distance_value(arr1.to_vec(), arr2.to_vec(), d), expected,); + assert_eq!(S::find_the_distance_value(arr1.to_vec(), arr2.to_vec(), d), expected); } } } diff --git a/src/problem_1453_maximum_number_of_darts_inside_of_a_circular_dartboard/mod.rs b/src/problem_1453_maximum_number_of_darts_inside_of_a_circular_dartboard/mod.rs index 45d8d4842..1a6401b5b 100644 --- a/src/problem_1453_maximum_number_of_darts_inside_of_a_circular_dartboard/mod.rs +++ b/src/problem_1453_maximum_number_of_darts_inside_of_a_circular_dartboard/mod.rs @@ -16,7 +16,7 @@ mod tests { ]; for ((darts, r), expected) in test_cases { - assert_eq!(S::num_points(darts.iter().map(Vec::from).collect(), r), expected,); + assert_eq!(S::num_points(darts.iter().map(Vec::from).collect(), r), expected); } } } diff --git a/src/problem_1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/mod.rs b/src/problem_1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/mod.rs index 60e222a8c..218b34314 100644 --- a/src/problem_1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/mod.rs +++ b/src/problem_1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero/mod.rs @@ -16,7 +16,7 @@ mod tests { ]; for ((n, connections), expected) in test_cases { - assert_eq!(S::min_reorder(n, connections.iter().map(Vec::from).collect()), expected,); + assert_eq!(S::min_reorder(n, connections.iter().map(Vec::from).collect()), expected); } } } diff --git a/src/problem_1515_best_position_for_a_service_centre/mod.rs b/src/problem_1515_best_position_for_a_service_centre/mod.rs index 72f028814..60b29bd5a 100644 --- a/src/problem_1515_best_position_for_a_service_centre/mod.rs +++ b/src/problem_1515_best_position_for_a_service_centre/mod.rs @@ -17,7 +17,7 @@ mod tests { ]; for (positions, expected) in test_cases { - approx::assert_ulps_eq!(S::get_min_dist_sum(positions.iter().map(Vec::from).collect()), expected,); + approx::assert_ulps_eq!(S::get_min_dist_sum(positions.iter().map(Vec::from).collect()), expected); } } } diff --git a/src/problem_1617_count_subtrees_with_max_distance_between_cities/mod.rs b/src/problem_1617_count_subtrees_with_max_distance_between_cities/mod.rs index 54ec7663e..712dfa6c9 100644 --- a/src/problem_1617_count_subtrees_with_max_distance_between_cities/mod.rs +++ b/src/problem_1617_count_subtrees_with_max_distance_between_cities/mod.rs @@ -25,7 +25,7 @@ mod tests { for ((n, edges), expected) in test_cases { assert_eq!( - S::count_subgraphs_for_each_diameter(n, edges.iter().map(Vec::from).collect(),), + S::count_subgraphs_for_each_diameter(n, edges.iter().map(Vec::from).collect()), expected, ); } diff --git a/src/problem_1641_count_sorted_vowel_strings/mod.rs b/src/problem_1641_count_sorted_vowel_strings/mod.rs index 3e086918a..628671daf 100644 --- a/src/problem_1641_count_sorted_vowel_strings/mod.rs +++ b/src/problem_1641_count_sorted_vowel_strings/mod.rs @@ -12,7 +12,7 @@ mod tests { let test_cases = [(1, 5), (2, 15), (33, 66045)]; for (n, expected) in test_cases { - assert_eq!(S::count_vowel_strings(n), expected,); + assert_eq!(S::count_vowel_strings(n), expected); } } } diff --git a/src/problem_1665_minimum_initial_energy_to_finish_tasks/mod.rs b/src/problem_1665_minimum_initial_energy_to_finish_tasks/mod.rs index d0ceb14ea..e7506b268 100644 --- a/src/problem_1665_minimum_initial_energy_to_finish_tasks/mod.rs +++ b/src/problem_1665_minimum_initial_energy_to_finish_tasks/mod.rs @@ -16,7 +16,7 @@ mod tests { ]; for (tasks, expected) in test_cases { - assert_eq!(S::minimum_effort(tasks.iter().map(Vec::from).collect()), expected,); + assert_eq!(S::minimum_effort(tasks.iter().map(Vec::from).collect()), expected); } } } diff --git a/src/problem_1668_maximum_repeating_substring/mod.rs b/src/problem_1668_maximum_repeating_substring/mod.rs index d646ec24d..7d0ce1190 100644 --- a/src/problem_1668_maximum_repeating_substring/mod.rs +++ b/src/problem_1668_maximum_repeating_substring/mod.rs @@ -18,7 +18,7 @@ mod tests { ]; for ((sequence, word), expected) in test_cases { - assert_eq!(S::max_repeating(sequence.to_string(), word.to_string()), expected,); + assert_eq!(S::max_repeating(sequence.to_string(), word.to_string()), expected); } } } diff --git a/src/problem_1691_maximum_height_by_stacking_cuboids/mod.rs b/src/problem_1691_maximum_height_by_stacking_cuboids/mod.rs index a4025b3e9..e6d684bff 100644 --- a/src/problem_1691_maximum_height_by_stacking_cuboids/mod.rs +++ b/src/problem_1691_maximum_height_by_stacking_cuboids/mod.rs @@ -82,7 +82,7 @@ mod tests { ]; for (cuboids, expected) in test_cases { - assert_eq!(S::max_height(cuboids.iter().map(Vec::from).collect()), expected,); + assert_eq!(S::max_height(cuboids.iter().map(Vec::from).collect()), expected); } } } diff --git a/src/problem_1735_count_ways_to_make_array_with_product/mod.rs b/src/problem_1735_count_ways_to_make_array_with_product/mod.rs index 3327fc95a..5bb338719 100644 --- a/src/problem_1735_count_ways_to_make_array_with_product/mod.rs +++ b/src/problem_1735_count_ways_to_make_array_with_product/mod.rs @@ -23,10 +23,7 @@ mod tests { ]; for &(queries, expected) in &test_cases[3..] { - assert_eq!( - S::ways_to_fill_array(queries.iter().copied().map(Vec::from).collect()), - expected, - ); + assert_eq!(S::ways_to_fill_array(queries.iter().map(Vec::from).collect()), expected); } } }