Leetcode 53 - Maximum Subarray (JAVA Solution Explained!)

preview_player
Показать описание
Leetcode 53 - Maximum Subarray (JAVA Solution Explained!)

If you like this video, please 'Like' or 'Subscribe'. This is really helpful for my channel and also motivates me to do more. Stay tuned!
Рекомендации по теме
Комментарии
Автор

what if all the numbers in the array are negative?

bisanghoul
Автор

this solution does not work. the test cases on this problem include negative number arrays, so the maximum sum can be negative.

AlexTurbo