Sort by

recency

|

2213 Discussions

|

  • + 1 comment

    c# :

     public static List<int> reverseArray(List<int> a)
        {
            int[] arr = a.ToArray();
            int j = arr.Length-1;
            for(int i = 0; i<arr.Length;i++)
            {
                int change = arr[i];
                
                    if (j > i)
                    {
                        arr[i] = arr[j];
                        arr[j] = change;
                        j--;
                    } 
                
            }
            return arr.ToList();
      }
    
  • + 0 comments

    def reverseArray(a): # Write your code here return list(reversed(a));

  • + 0 comments

    a.reverse() return a

  • + 0 comments

    def reverseArray(a): left = 0 right = len(a)-1

            while right > left:
                        a[left], a[right] = a[right],a[left]
                        left += 1
                        right -= 1
    

    return a

  • + 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;
    }