public class MaxOfAnArray {
public static void main(String[] args) {
int[] arr = new int[]{15, 30, 40, 4, 11, 9};
System.out.println(maxOfArray(arr, 0));
}
public static int maxOfArray(int[] arr, int idx) {
// base case
if (idx == arr.length)
return Integer.MIN_VALUE;
// faith
int val1 = maxOfArray(arr, idx+1);
int val2 = arr[idx];
return val1 > val2 ? val1 : val2;
}
}
Saturday, January 29, 2022
Max Of An Array
Subscribe to:
Post Comments (Atom)
Diagonal Traversal
eg. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Output: 1 6 11 16 2 7 12 3 8 4 Approach:...
-
https://leetcode.com/problems/reverse-integer/description/ Integer.MAX_VALUE = 2,147,483,647 = 2 31 - 1 Integer.MIN_VALUE = -2,147,483,64...
-
https://leetcode.com/problems/two-sum/description/ Given the constraints: 2 <= nums.length <= 10⁴ -10⁹ <= nums[i] <= 10⁹ -10...
-
For this particular question, we only have the In - region. So, the code looks like : package pep.Day7 ; public class TowerOfHanoi { p...
No comments:
Post a Comment