2019년 9월

public class Test1 {

	public static void main(String[] args) {
		Solution s = new Solution();
		System.out.println(s.solution(new int[] {5, 3, 7}, new int[] {3, 7, 6})); // 3
		System.out.println(s.solution(new int[] {1, 2}, new int[] {2, 3, 1})); // 2
		System.out.println(s.solution(new int[] {3, 8, 6}, new int[] {5, 6, 4})); // 2
	}

}

class Solution{
	
	public int solution(int[] goods, int[] boxes) {
		Arrays.sort(goods);
		Arrays.sort(boxes);
		int answer = 0;
		int i = goods.length-1;
		int j = boxes.length-1;
		while (i >= 0 && j >= 0){
			if(goods[i] <= boxes[j]) {
				answer++;
				j--;
			}
			i--;
		}
		return answer;
	}
	
}

public class Test2 {

	public static void main(String[] args) {
		Solution s = new Solution();
		System.out.println(s.solution(new String[] {"D5"})); //50
		System.out.println(s.solution(new String[] {"D5", "E8", "G2"})); //42
	}

}

class Solution {
    public int solution(String[] bishops) {
        int answer = 0;
        
        // D5를 체스판 위치로 변경
        int [][] positions = new int[bishops.length][2];
        for(int i=0; i<bishops.length; i++) {
        	positions[i][0] = bishops[i].charAt(0)-'A';
        	positions[i][1] = bishops[i].charAt(1)-'1';
        }

	// 체크를 위한 boolean 이차원 배열 만들기
	boolean[][] board = new boolean[8][8];

	for(int k=0; k<positions.length; k++) {
		int x = positions[k][0];
		int y = positions[k][1];
		for(int i=0; i<board.length; i++) {
			for(int j=0; j<board[0].length; j++) {
				// 비숍이 갈 수 있는 곳 판단
				if(Math.abs(x - i) == Math.abs(y - j)) {
					board[i][j] = true;
				}
			}
		}
	}
        
        // boolean 배열의 false 카운트
        for(int i=0; i<board.length; i++) {
        	for(int j=0; j<board[0].length; j++) {
        		if(board[i][j] == false) answer ++;
        	}
        }
        return answer;
    }

}

public class Test3 {

	public static void main(String[] args) {
		Solution s = new Solution();
		System.out.println(s.solution(new int[] {12, 12, 12, 12, 12})); //36
		System.out.println(s.solution(new int[] {12, 80, 14, 22, 100})); //180
	}

}

class Solution {
    public int solution(int[] sticker) {
        int[] dp = new int[sticker.length];
        dp[0] = sticker[0];
        dp[1] = Math.max(dp[0], sticker[1]);
        for(int i=2; i<sticker.length; i++) {
        	dp[i] = Math.max(dp[i-2] + sticker[i], dp[i-1]);
        }
        return dp[sticker.length-1];
    }
}