Leetcode Problem 845. Longest Mountain in Array
Leetcode Solutions
Two Pointer Approach for Longest Mountain in Array
- Initialize the longest mountain length to 0.
- Use a base pointer to iterate through the array, starting from index 0.
- For each base, if it's a valid starting point (arr[base] < arr[base + 1]), try to find the peak of the mountain.
- Move the end pointer up as long as arr[end] < arr[end + 1] to find the peak.
- Once the peak is found, continue moving the end pointer down as long as arr[end] > arr[end + 1] to find the end of the mountain.
- Update the longest mountain length if the current mountain is longer.
- Move the base pointer to the end of the current mountain or to the next potential starting point.
- Repeat steps 3-7 until the end of the array is reached.
- Return the longest mountain length.
Dynamic Programming Approach for Longest Mountain in Array
Ask Question
Programming Language
Purpose:
image/screenshot of info(optional)
Full Screen
Loading...
Suggested Answer
Answer
Full Screen
Copy Answer Code
Loading...