You are viewing a single comment's thread. Return to all comments →
while(i <= j ) { //int max1 = max((int)s1[i],(int)s1[j]) ; //int min1 = min ((int)s1[i],(int)s1[j]) ;
//ans += (max1 - min1) ; ans+=abs(s1[i]-s1[j]); i++; j--; }
The Love-Letter Mystery
You are viewing a single comment's thread. Return to all comments →
while(i <= j ) { //int max1 = max((int)s1[i],(int)s1[j]) ; //int min1 = min ((int)s1[i],(int)s1[j]) ;