Update Solution.java

javadev · web-flow · commit d2806d95bc16 · 2022-02-27T05:31:50.000+02:00
diff --git a/src/main/java/g1001_1100/s1033_moving_stones_until_consecutive/Solution.java b/src/main/java/g1001_1100/s1033_moving_stones_until_consecutive/Solution.java
@@ -12,7 +12,6 @@ private int minMoves(int x, int y, int z) {
         if (y - x <= 2 || z - y <= 2) {
             return 1;
         }
-
         return 2;
     }
 
@@ -23,10 +22,8 @@ private int maxMoves(int x, int z) {
     public int[] numMovesStones(int a, int b, int c) {
         int[] t = {a, b, c};
         Arrays.sort(t);
-
         int min = minMoves(t[0], t[1], t[2]);
         int max = maxMoves(t[0], t[2]);
-
         return new int[] {min, max};
     }
 }

Original file line number	Diff line number	Diff line change
`@@ -12,7 +12,6 @@ private int minMoves(int x, int y, int z) {`
`12`	`12`	`if (y - x <= 2 \|\| z - y <= 2) {`
`13`	`13`	`return 1;`
`14`	`14`	`}`
`15`		`-`
`16`	`15`	`return 2;`
`17`	`16`	`}`
`18`	`17`
`@@ -23,10 +22,8 @@ private int maxMoves(int x, int z) {`
`23`	`22`	`public int[] numMovesStones(int a, int b, int c) {`
`24`	`23`	`int[] t = {a, b, c};`
`25`	`24`	`Arrays.sort(t);`
`26`		`-`
`27`	`25`	`int min = minMoves(t[0], t[1], t[2]);`
`28`	`26`	`int max = maxMoves(t[0], t[2]);`
`29`		`-`
`30`	`27`	`return new int[] {min, max};`
`31`	`28`	`}`
`32`	`29`	`}`