Leetcode 689 Maximum Sum of 3 Non-Overlapping Subarrays

preview_player
Показать описание


My gears:

Рекомендации по теме
Комментарии
Автор

thanks for the great explanation, struggled with leetcode's explanation. Love that you are doing most of the frequently asked google and fb questions.

josephkevinmachado
Автор

Pretty good! I understood the intuitive approach. Thanks for your efforts!

madhusudanr
Автор

This is the best explanation I have ever found for this question, thanks a lot. And by the way, can you do Critical Connections in a Network too?

estherl
Автор

what's the time and space complexity?

stoneyang
Автор

I don't understand how this solution is correct -- e.g. in the two windows case, it's using two non-overlapping windows but the windows are alway next to each other. But the question does not require the windows to be next to each other. Am I missing something?

lchthu
visit shbcf.ru