Leetcode Problem 485. Max Consecutive Ones

485. Max Consecutive Ones

Leetcode Solutions

Key approach of the solution

  1. Initialize a variable max_count to 0 to keep track of the maximum number of consecutive 1s.
  2. Initialize a variable current_count to 0 to keep track of the current number of consecutive 1s.
  3. Iterate through each element in the array nums. a. If the current element is 1, increment current_count by 1. b. If the current element is 0, compare current_count with max_count and update max_count if necessary. Then reset current_count to 0.
  4. After the loop, compare current_count with max_count one last time to account for a sequence that might end at the last element.
  5. Return max_count as the result.
UML Thumbnail

Alternative approach using string manipulation

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...