Longest Subarray of 1's After Deleting One Element- Leetcode 1493 - Python

Поделиться
HTML-код
  • Опубликовано: 18 сен 2024

Комментарии • 10

  • @techerror8
    @techerror8  Год назад +1

    Hello Guys, DON'T FORGET To LIKE & Subscribe. Press the Bell icon🔔for notification :)

  • @datastructure_algorithem01
    @datastructure_algorithem01 6 месяцев назад +2

    didn't understand how 111001 is valid when 11110101 is in valid both have 2 zero

  • @Ethiopicworship
    @Ethiopicworship 7 месяцев назад +1

    God bless you,keep up

    • @techerror8
      @techerror8  7 месяцев назад +1

      Glad it Helped :) Subscribe for more :)

  • @peterfarrell66
    @peterfarrell66 Год назад +1

    Wow! Very short and fast!

    • @techerror8
      @techerror8  Год назад

      Glad it helped :)

    • @peterfarrell66
      @peterfarrell66 Год назад +1

      @@techerror8 After I solve these I try to learn to improve my program by looking at other people’s solutions and yours are by far the best!

  • @thiagot7706
    @thiagot7706 Год назад +1

    Why
    zeroes += nums[l] == 0
    Adds 1?

    • @thiagot7706
      @thiagot7706 Год назад +1

      Aah, I think now I get it.
      nums[l] == 0
      is a boolean that will represent 0 or 1.
      So is like:
      zeroes += 1 when true

    • @techerror8
      @techerror8  Год назад +2

      yes u got it right :) Subscribe for more :)