题:https://leetcode.com/problems/valid-mountain-array/description/
题目
Given an array A of integers, return true if and only if it is a valid mountain array.
Recall that A is a mountain array if and only if:
A.length >= 3
There exists some i with 0 < i < A.length - 1 such that:
A[0] < A[1] < ... A[i-1] < A[i]
A[i] > A[i+1] > ... > A[B.length - 1]
Example 1:
Input: [2,1]
Output: false
Example 2:
Input: [3,5,5]
Output: false
Example 3:
Input: [0,3,2,1]
Output: true
Note:
- 0 <= A.length <= 10000
- 0 <= A[i] <= 10000
题目大意
数组A[] 进行排列,使 A中的数据呈现山峰的形状,即 两边低中间高。
思路
从第2个数开始遍历,根据 不同阶段判断,分别判断 i 位于 山前段,山顶,山后端,分别处理。
若在前段,A[i-1] <A[i]。
若山顶,A[i-1]<A[i]>A[i+1]。
若山后端,A[i-1]>A[i]
若都不属于 返回false。
若 遍历完,未经历过 山顶 ,返回false,若经过,返回true。
class Solution {
public boolean validMountainArray(int[] A) {
boolean isDescent = false;
for(int i = 1 ;i < A.length;i++){
if(isDescent== false && (i+1)<A.length && A[i-1]<A[i] && A[i]>A[i+1] ){
isDescent = true;
continue;
}
if(isDescent== false && A[i-1]<A[i])
continue;
if(isDescent == true && A[i-1]>A[i])
continue;
return false;
}
return isDescent;
}
}