-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathValidMountainArray.php
More file actions
66 lines (63 loc) · 1.58 KB
/
Copy pathValidMountainArray.php
File metadata and controls
66 lines (63 loc) · 1.58 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
<?php
namespace App;
/**
* Valid Mountain Array
*
* Given an array of integers arr, return true if and only if it is a valid mountain array.
* Recall that arr is a mountain array if and only if:
* arr.length >= 3
* There exists some i with 0 < i < arr.length - 1 such that:
* arr[0] < arr[1] < ... < arr[i - 1] < arr[i]
* arr[i] > arr[i + 1] > ... > arr[arr.length - 1]
* Example 1:
* Input: arr = [2,1]
* Output: false
*
* Example 2:
* Input: arr = [0,3,2,1]
* Output: true
*
* https://leetcode.com/problems/valid-mountain-array
*/
class ValidMountainArray
{
/**
* @param array<array-key, int> $arr
* @return bool
*/
public function validMountainArray(array $arr): bool
{
$arrSize = count($arr);
if ($arrSize < 3) {
return false;
}
$max = $arr[0];
$up = false;
$down = false;
for ($i = 1; $i < $arrSize; $i++) {
if ($arr[$i] > $max) {
$max = $arr[$i];
$up = true;
} else {
break;
}
}
if ($i < $arrSize) {
$min = $arr[$i];
$i++;
if ($i < $arrSize) {
for ($i = $i; $i < $arrSize; $i++) {
if ($arr[$i] < $min) {
$min = $arr[$i];
$down = true;
} else {
break;
}
}
} else {
$down = ($min < $max);
}
}
return $up && $down && ($i === $arrSize);
}
}