firebotQL / Competitive-Programming

Competitive programming
10 stars 2 forks source link

Leetcode - Maximum Subarray #46

Closed firebotQL closed 5 years ago

firebotQL commented 5 years ago

O(nlogn) - divide and conquer solution. Kadane is O(n) which is better.