classSolution{publicbooleanvalidMountainArray(int[] A){int len = A.length;int i =0;while(i +1< len && A[i]< A[i +1])
i++;if(i ==0|| i == len -1)returnfalse;while(i +1< len && A[i]> A[i +1])
i++;return i == len -1;}}
本地测试代码
package com.company;publicclassSolution_941{publicstaticbooleanvalidMountainArray(int[] A){int len = A.length;int i =0;while(i +1< len && A[i]< A[i +1])
i++;if(i ==0|| i == len -1)returnfalse;while(i +1< len && A[i]> A[i +1])
i++;return i == len -1;}publicstaticvoidmain(String[] args){
System.out.println(validMountainArray(newint[]{2,1}));
System.out.println(validMountainArray(newint[]{3,5,5}));
System.out.println(validMountainArray(newint[]{0,3,2,1}));}}