2015-10-11 [滴滴]--研发工程师--1~4面

int get_max_sum(const vector<int> &nums)
{
    int ans = 0;

    if (nums.size() == 0)
        return 0;

    int cnt_val = nums[0];

    if (nums.size() == 1) {
        ans = ans > cnt_val ? ans : cnt_val;
        return ans;
    }

    for (int i = 1; i < nums.size(); i++) {
        if (cnt_val > 0)
            cnt_val += nums[i];
        else
            cnt_val = nums[i];
        ans = ans > cnt_val ? ans : cnt_val;
    }

    return ans;
}

int main()
{
    struct TestCase {
        vector<int> nums;
        int ret;
    } test_cases [] = {

        {
            { -1, -1, -1 },
            0
        },

        {
            { -1, -9, 10, -3, 19 },
            26
        },

        {
            { -1, 20, -9, 10, -3, 19 },
            37
        },

    };

    for (int iii = 0; iii < sizeof(test_cases) / sizeof(TestCase); iii++) {

        TestCase &tc = test_cases[iii];

        auto ret = get_max_sum(tc.nums);

        if ( tc.ret != ret ) {
            cout << "Case #" << iii << " failed" << endl;
            cout << "Actual ret=" << ret << endl;
            return -1;
        }
    }

    return 0;
}