笔记 leetcode852 mountain 数组 找出最大值的下标
Let's call an array A a mountain if the following properties hold:A.length >= 3There exists some 0 < i < A.length - 1 such that A[0] < A[1] < ... A[i-1] < A[i] > A[i+1] > ... &...
原创
2018-06-19 23:38:56 ·
272 阅读 ·
0 评论