프로그래머스 C# 배열 뒤집기(for문 역순으로 출력, Reverse, Linq / ToArray, P, J)

using System;

public class Solution {
    public int[] solution(int[] num_list) {
        int[] answer = new int[num_list.Length];
        int i = 0;
        for(i=num_list.Length-1;i>=0;i--)
        {
            answer[num_list.Length-i-1] = num_list[i];
        }
        return answer;
    }
}

 

 

 

for문으로 맨 마지막 부터 집어 넣기

 

 

using System;

public class Solution {
    public int[] solution(int[] num_list) {
        int[] answer = new int[num_list.Length];
        int K =0;
        for(int i = num_list.Length-1;i >= 0;i--)
        {
            answer[K] = num_list[i];
                K++;
        }
        return answer;
    }
}

/////

using System;
using System.Linq;

public class Solution {
    public int[] solution(int[] num_list) {
        int[] answer = num_list.Reverse().ToArray();
        return answer;
    }
}

 

 

// int[] 는 Reverse하고 ToArray해야 한다.

 

파이썬

////

 

 

def solution(num_list):
    return num_list[::-1]

 

 

파이썬 리버스

 

 

def solution(num_list):
    num_list.reverse()
    return num_list

 

 

자바

 

 

class Solution {
    public int[] solution(int[] num_list) {
        int[] answer = new int[num_list.length];
        
        for(int i = 0; i< num_list.length; i++)
        {
            answer[i] = num_list[num_list.length-i-1];
        }
        
        return answer;
    }
}

 

 

import java.util.Collections;
import java.util.List;
import java.util.stream.Collectors;
import java.util.Arrays;

class Solution {
    public int[] solution(int[] numList) {
        List<Integer> list = Arrays.stream(numList).boxed().collect(Collectors.toList());

        Collections.reverse(list);
        return list.stream().mapToInt(Integer::intValue).toArray();
    }
}