Format - Google java formatter

Author: github-actions

Recursion/JosephusProblem/Solution.java

@@ -6,14 +6,12 @@
 /**
  * * Josephus Problem
  */
-
 public class Solution {
   private int solveJosephusProblem(List<Integer> soldiers, int k, int index) {
     /**
      * Base Case.
      */
-    if (soldiers.size() == 1)
-      return soldiers.get(0);
+    if (soldiers.size() == 1) return soldiers.get(0);
 
     int killIdx = (index + k) % soldiers.size();
     soldiers.remove(killIdx);
@@ -24,8 +22,7 @@ private int solveJosephusProblem(List<Integer> soldiers, int k, int index) {
   public int solveJosephusProblem(int n, int k) {
     List<Integer> soldiers = new ArrayList<>();
 
-    for (int idx = 1; idx <= n; idx++)
-      soldiers.add(idx);
+    for (int idx = 1; idx <= n; idx++) soldiers.add(idx);
 
     return solveJosephusProblem(soldiers, k - 1, 0);
   }
@@ -35,4 +32,4 @@ public static void main(String[] args) {
 
     System.out.println(solution.solveJosephusProblem(14, 2));
   }
-}
+}