MaxSliceSum

發表於 | 分類於 ，

problem

solution

Kadane’s Algorithm

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

// you can use includes, for example:
// #include <algorithm>

// you can write to stdout for debugging purposes, e.g.
// cout << "this is a debug message" << endl;

int solution(vector<int> &A) {
    // write your code in C++14 (g++ 6.2.0)
    int local = 0, global = -1000000;
    for(int a:A){
        local = max(a, a+local);
        global = max(global, local);
    }
    return global;
}

analysis

  • time complexity O(n)
  • space complexity O(1)