maximum subarray whose sum equals 0

后端 未结 12 1372
礼貌的吻别
礼貌的吻别 2020-12-04 08:14

An array contains both positive and negative elements, find the maximum subarray whose sum equals 0.

12条回答
  •  日久生厌
    2020-12-04 08:40

    Hope this will help.

    int v[DIM] = {2, -3,  1,  2,  3,  1,  4, -6,  7, -5, -1};
    int i,j,sum=0,counter=0;
    
        for (i=0; i

提交回复
热议问题