Skip to content

Instantly share code, notes, and snippets.

Show Gist options
  • Save aceqbaceq/72de302f20045d4f9cfa9b323b8adefe to your computer and use it in GitHub Desktop.
Save aceqbaceq/72de302f20045d4f9cfa9b323b8adefe to your computer and use it in GitHub Desktop.
var sr;
sr=[];
var zs;
zs=0;
var ar;
ar=[];
ar=[100, -9, 2, -3, 5];
q = getMaxSubSum(ar);
var arb;
arb=[];
var pp;
pp=0;
for (i=q[1];i<=q[2];i++) {
arb[pp]=ar[i];
pp=pp+1;
};
alert ("array=["+ar + "], subarray=["+ arb + "], sum="+q[0]);
function getMaxSubSum(a) {
le=a.length-1;
for (var i=0;i<=le;i++){
for (var j = i + 1;j<=le; j++) {
var sum;
sum=0;
for (var k = i; k <= j; k++) {
sum=sum + a [k];
};
// alert ("i="+i+", j="+j+", sum="+sum);
sr[zs]=[sum,i,j];
zs=zs+1;
};
};
for (var i=0;i<=le ;i++){
sr[zs]=[ar[i],i,i];
zs=zs+1;
};
var max;
max=sr[0][0];
var max2;
max2=[];
for (var i=0; i<zs; i++){
// alert ("i="+sr[i][1]+", j="+sr[i][2]+", sum="+sr[i][0]);
if (sr[i][0]>max) {
max=sr[i][0];
max2=[max,sr[i][1], sr[i][2] ];
};
};
return max2;
};
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment