largest sum java_split-array-largest-sum（参考了discuss）

nums[i];

}

}

return true;

}

/*

class KPair {

public int pos;

public int m;

@Override

public int hashCode() {

int ret = String.valueOf(pos).hashCode() ^ String.valueOf(m).hashCode();

return ret;

}

@Override

public boolean equals(Object obj) {

if (null == obj) {

return false;

}

if (!(obj instanceof KPair)) {

return false;

}

KPair kp = (KPair)obj;

//System.out.printf("kp%d p%d km%d m%d\n", kp.pos, pos, kp.m, m);

return kp.pos == pos && kp.m == m;

}

}

public int splitArray(int[] nums, int m) {

Map mp = new HashMap();

KPair okp = new KPair();

int tmp = 0;

int newval = 0;

KPair kp = new KPair();

kp.pos = 0;

kp.m = 1;

//System.out.printf("in1 p%d m%d\n", kp.pos, kp.m);

mp.put(kp, nums[0]);

for (int i=1; i

okp.pos = i-1;

okp.m = 1;

tmp = (int)(mp.get(okp))+nums[i];

KPair kp2 = new KPair();

kp2.pos = i;

kp2.m = 1;

//System.out.printf("in2 p%d m%d\n", kp2.pos, kp2.m);

mp.put(kp2, tmp);

for (int k=0; k

// tmp is sum of k+1 to i

tmp -= nums[k];

okp.pos = k;

for (int j=2; j<=m && j<=k+2; j++) {

okp.m = j-1;

//System.out.printf("for2 p%d m%d\n", okp.pos, okp.m);

newval = (int)(mp.get(okp));

if (tmp > newval) {

newval = tmp;

}

KPair kp3 = new KPair();

kp3.pos = i;

kp3.m = j;

if (mp.get(kp3) == null || (int)(mp.get(kp3)) > newval) {

//System.out.printf("in3 p%d m%d\n", kp3.pos, kp3.m);

mp.put(kp3, newval);

}

}

}

}

KPair kpr = new KPair();

kpr.pos = nums.length-1;

kpr.m = m;

return (int)(mp.get(kpr));

}

*/}