Skip to content

feat: add solutions to lc problem: No.0845 #792

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Apr 7, 2022
Merged

feat: add solutions to lc problem: No.0845 #792

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
69 changes: 67 additions & 2 deletions solution/0800-0899/0845.Longest Mountain in Array/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -67,15 +67,80 @@
<!-- 这里可写当前语言的特殊实现逻辑 -->

```python

class Solution:
def longestMountain(self, arr: List[int]) -> int:
left, right = 0, 1
status = -1
ans = 0
while right < len(arr):
if status == -1 or status == 1:
if arr[right] == arr[right - 1]:
status = -1
if status == -1:
if arr[right] > arr[right - 1]:
status = 1
else:
left = right
if status == 1 and arr[right] < arr[right - 1]:
status = 2
else:
if arr[right] == arr[right - 1]:
status = -1
ans = max(ans, right - left)
left = right
elif arr[right] > arr[right - 1]:
status = 1
ans = max(ans, right - left)
left = right - 1
right += 1
if status == 2:
ans = max(right - left, ans)
return ans
```

### **Java**

<!-- 这里可写当前语言的特殊实现逻辑 -->

```java

class Solution {
public int longestMountain(int[] arr) {
int left = 0, right = 0;
int ans = 0;
int status = -1;
while (++right < arr.length) {
if (status == -1 || status == 1) {
if (arr[right] == arr[right - 1]) {
status = -1;
}
if (status == -1) {
if (arr[right] > arr[right - 1]) {
status = 1;
} else {
left = right;
}
}
if (status == 1 && arr[right] < arr[right - 1]) {
status = 2;
}
} else {
if (arr[right] > arr[right - 1]) {
status = 1;
ans = Math.max(right - left, ans);
left = right - 1;
} else if (arr[right] == arr[right - 1]) {
status = -1;
ans = Math.max(right - left, ans);
left = right;
}
}
}
if (status == 2) {
ans = Math.max(ans, right - left);
}
return ans;
}
}
```

### **...**
Expand Down
69 changes: 67 additions & 2 deletions solution/0800-0899/0845.Longest Mountain in Array/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -58,13 +58,78 @@
### **Python3**

```python

class Solution:
def longestMountain(self, arr: List[int]) -> int:
left, right = 0, 1
status = -1
ans = 0
while right < len(arr):
if status == -1 or status == 1:
if arr[right] == arr[right - 1]:
status = -1
if status == -1:
if arr[right] > arr[right - 1]:
status = 1
else:
left = right
if status == 1 and arr[right] < arr[right - 1]:
status = 2
else:
if arr[right] == arr[right - 1]:
status = -1
ans = max(ans, right - left)
left = right
elif arr[right] > arr[right - 1]:
status = 1
ans = max(ans, right - left)
left = right - 1
right += 1
if status == 2:
ans = max(right - left, ans)
return ans
```

### **Java**

```java

class Solution {
public int longestMountain(int[] arr) {
int left = 0, right = 0;
int ans = 0;
int status = -1;
while (++right < arr.length) {
if (status == -1 || status == 1) {
if (arr[right] == arr[right - 1]) {
status = -1;
}
if (status == -1) {
if (arr[right] > arr[right - 1]) {
status = 1;
} else {
left = right;
}
}
if (status == 1 && arr[right] < arr[right - 1]) {
status = 2;
}
} else {
if (arr[right] > arr[right - 1]) {
status = 1;
ans = Math.max(right - left, ans);
left = right - 1;
} else if (arr[right] == arr[right - 1]) {
status = -1;
ans = Math.max(right - left, ans);
left = right;
}
}
}
if (status == 2) {
ans = Math.max(ans, right - left);
}
return ans;
}
}
```

### **...**
Expand Down
38 changes: 38 additions & 0 deletions solution/0800-0899/0845.Longest Mountain in Array/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,38 @@
class Solution {
public int longestMountain(int[] arr) {
int left = 0, right = 0;
int ans = 0;
int status = -1;
while (++right < arr.length) {
if (status == -1 || status == 1) {
if (arr[right] == arr[right - 1]) {
status = -1;
}
if (status == -1) {
if (arr[right] > arr[right - 1]) {
status = 1;
} else {
left = right;
}
}
if (status == 1 && arr[right] < arr[right - 1]) {
status = 2;
}
} else {
if (arr[right] > arr[right - 1]) {
status = 1;
ans = Math.max(right - left, ans);
left = right - 1;
} else if (arr[right] == arr[right - 1]) {
status = -1;
ans = Math.max(right - left, ans);
left = right;
}
}
}
if (status == 2) {
ans = Math.max(ans, right - left);
}
return ans;
}
}
29 changes: 29 additions & 0 deletions solution/0800-0899/0845.Longest Mountain in Array/Solution.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
class Solution:
def longestMountain(self, arr: List[int]) -> int:
left, right = 0, 1
status = -1
ans = 0
while right < len(arr):
if status == -1 or status == 1:
if arr[right] == arr[right - 1]:
status = -1
if status == -1:
if arr[right] > arr[right - 1]:
status = 1
else:
left = right
if status == 1 and arr[right] < arr[right - 1]:
status = 2
else:
if arr[right] == arr[right - 1]:
status = -1
ans = max(ans, right - left)
left = right
elif arr[right] > arr[right - 1]:
status = 1
ans = max(ans, right - left)
left = right - 1
right += 1
if status == 2:
ans = max(right - left, ans)
return ans