We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
SOLUTION FOR JAVA:
public static void findZigZagSequence(int [] a, int n){
Arrays.sort(a);
int mid = ((n + 1)/2)-1;
int temp = a[mid];
a[mid] = a[n - 1];
a[n - 1] = temp;
int st = mid + 1;
int ed = n - 2;
while(st <= ed){
temp = a[st];
a[st] = a[ed];
a[ed] = temp;
st = st + 1;
ed = ed - 1;
}
for(int i = 0; i < n; i++){
if(i > 0) System.out.print(" ");
System.out.print(a[i]);
}
System.out.println();
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Zig Zag Sequence
You are viewing a single comment's thread. Return to all comments →
SOLUTION FOR JAVA: public static void findZigZagSequence(int [] a, int n){ Arrays.sort(a); int mid = ((n + 1)/2)-1; int temp = a[mid]; a[mid] = a[n - 1]; a[n - 1] = temp;