fix smells

src/main/java/g1401_1500/s1471_the_k_strongest_values_in_an_array/Solution.java

@@ -9,7 +9,8 @@ public int[] getStrongest(int[] arr, int k) {
  Arrays.sort(arr);
  int[] array = new int[k];
  int median = arr[(arr.length - 1) / 2];
- int start = 0, end = arr.length - 1;
+ int start = 0;
+ int end = arr.length - 1;
  for (int i = 0; i < k; i++) {
  if (Math.abs(arr[end] - median) >= Math.abs(arr[start] - median)) {
  array[i] = arr[end];

src/main/java/g1401_1500/s1473_paint_house_iii/Solution.java

@@ -8,7 +8,7 @@ public class Solution {
  private int nColors;
  private int[][] cost;
 
- public int minCost(int[] houses, int[][] cost, int nHouses, int nColors, int tGroups) {
+ public int minCost(int[] houses, int[][] cost, int nColors, int tGroups) {
  this.cost = cost;
  this.houses = houses;
  this.memo = new int[houses.length][nColors + 1][tGroups + 1];

src/test/java/g1401_1500/s1473_paint_house_iii/SolutionTest.java

@@ -13,7 +13,6 @@ void minCost() {
  .minCost(
  new int[] {0, 0, 0, 0, 0},
  new int[][] {{1, 10}, {10, 1}, {10, 1}, {1, 10}, {5, 1}},
- 5,
  2,
  3),
  equalTo(9));
@@ -26,7 +25,6 @@ void minCost2() {
  .minCost(
  new int[] {0, 2, 1, 2, 0},
  new int[][] {{1, 10}, {10, 1}, {10, 1}, {1, 10}, {5, 1}},
- 5,
  2,
  3),
  equalTo(11));
@@ -39,7 +37,6 @@ void minCost3() {
  .minCost(
  new int[] {3, 1, 2, 3},
  new int[][] {{1, 1, 1}, {1, 1, 1}, {1, 1, 1}, {1, 1, 1}},
- 4,
  3,
  3),
  equalTo(-1));