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.
  1. Prepare
  2. Data Structures
  3. Arrays
  4. Arrays - DS
  5. Discussions

Arrays - DS

Sort by

recency

|

2209 Discussions

|

  • nderevj
     + 0 comments
    function reverseArray(a: number[]): number[] {
    const n = a.length;
    for(let i = 0; i < n / 2; i++) {
        const temp = a[i];
        a[i] = a[n - 1 - i];
        a[n - 1 - i] = temp;
    }
    return a;
}

  • 24501a05k1
     + 0 comments
    public static List<Integer> reverseArray(List<Integer> a) {
// Write your code here
List<Integer> reversed = new ArrayList<>();
for (int i = a.size() - 1; i >= 0; i--) {
    reversed.add(a.get(i));
}
return reversed;

    }

  • mabdullahsaleem1
     + 0 comments

    def reverseArray(a): # Write your code here r=a[::-1] return r

  • diyadavidpnc
     + 0 comments

    Java 7 Solution

    int n = a.size();

for(int i = 0;i<n/2;i++){

    int temp = a.get(i);
    a.set(i, a.get(n-i-1));
    a.set((n-i-1), temp);

}

  • RitaMAzevedo
     + 0 comments

    Sometimes i forget some function can turn it much more simple. Here is in Java 8

    Collections.reverse(a);
return a;