m0_54974045: 嗷，不能连续上坡

m0_54974045: 测试用示例1，从00开始走，2 1 4 3 2不是挪了四步？

飞《雨》: 可读性不是很好 [code=java] public int validMountainCount(int[] arr) { int count = 0; for (int i = 0; i < arr.length; i++) { if (isHigherThanLeft(arr, i) && isHigherThanRight(arr, i)) { count++; } } return count; } public boolean isHigherThanLeft(int[] arr, int i) { if (i - 1 < 0) { return true; } return arr[i] > arr[i - 1]; } public boolean isHigherThanRight(int[] arr, int i) { if (i + 1 > arr.length - 1) { return true; } return arr[i] > arr[i + 1]; } [/code]

qq_42003397: [code=java] public static void dfs(int[] nums, int index, int pre, int[] sum) { sum[0] = Math.max(pre, sum[0]); if (index > nums.length - 1 || nums[index] == -1) { return; } int val = nums[index]; int left = 2 * index + 1; int right = 2 * index + 2; dfs(nums, left, pre + val, sum); dfs(nums, right, pre + val, sum); } [/code]

T'T: [code=java] public static int getResult(int[][] arr, int num) { int sum = 0; int l = 1; int r = num; boolean f = true; while (l = r) { minr = Math.min(minr, ints[0]); if (minr - 1 < l) { f = !f; break; } } } l = maxl + 1; r = minr - 1; sum += f ? 2 : 1; } return sum; } [/code]