코딩테스트 입문 - Day 10

점의 위치 구하기

---

class Solution {
    public int solution(int[] dot) {
        if(dot[0] > 0 && dot[1] > 0){
            return 1;
        }else if(dot[0] < 0 && dot[1] > 0){
            return 2;
        }else if(dot[0] < 0 && dot[1] < 0){
            return 3;
        }else{
            return 4;
        }
    }
}

2차원으로 만들기

---

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

공 던지기

---

class Solution {
    public int solution(int[] numbers, int k) {
        int p = (k-1) *2 % numbers.length;
        return numbers[p];
    }
}

배열 회전시키기

---

class Solution {
	public int[] solution(int[] numbers, String direction) {
		int[] answer = new int[numbers.length];
		int start = 1;
		if (direction.equals("right")) {
			for (int i = start; i < numbers.length; i++) {
				answer[i] = numbers[i - start];
			}
			answer[0] = numbers[numbers.length - 1];

		} else {
			for (int i = 0; i < numbers.length-1; i++) {
				answer[i] = numbers[i + start];
			}
			answer[answer.length - 1] = numbers[0];
		}
		return answer;
	}
}