Tuesday, August 28, 2018

Leetcode 53 - Maximum subarray - divide and conquer

August 28, 2018

Introduction


It may be valuable to document failed practice. I tried to fix the issue in my first practice using divide and conquer for the algorithm Maximum subarray, and then I tried to simplify code, spent another 20 minutes, and then I concluded that the design has flaw, there is no way to lead to a solution.

My practice


Here is the code I spent another 20 minutes but failed to lead a solution.


No comments:

Post a Comment