mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-26 05:59:22 +08:00
Format code with prettier (#3375)
This commit is contained in:
@ -17,8 +17,10 @@ public class FindMaxRecursion {
|
||||
array[i] = rand.nextInt() % 100;
|
||||
}
|
||||
|
||||
assert max(array, array.length) == Arrays.stream(array).max().getAsInt();
|
||||
assert max(array, 0, array.length - 1) == Arrays.stream(array).max().getAsInt();
|
||||
assert max(array, array.length) ==
|
||||
Arrays.stream(array).max().getAsInt();
|
||||
assert max(array, 0, array.length - 1) ==
|
||||
Arrays.stream(array).max().getAsInt();
|
||||
}
|
||||
|
||||
/**
|
||||
@ -50,6 +52,8 @@ public class FindMaxRecursion {
|
||||
* @return max value of {@code array}
|
||||
*/
|
||||
public static int max(int[] array, int len) {
|
||||
return len == 1 ? array[0] : Math.max(max(array, len - 1), array[len - 1]);
|
||||
return len == 1
|
||||
? array[0]
|
||||
: Math.max(max(array, len - 1), array[len - 1]);
|
||||
}
|
||||
}
|
||||
|
Reference in New Issue
Block a user