๐Ÿ“š ์ฝ”๋”ฉํ…Œ์ŠคํŠธ/๋ฐฑ์ค€ & ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค][JAVA]Level 0 : ์บ๋ฆญํ„ฐ์˜ ์ขŒํ‘œ

deep_lee 2022. 12. 10. 22:03

 

 


keyinput.length ๋งŒํผ ๋ฐ˜๋ณต๋ฌธ์—์„œ ์กฐ๊ฑด๋ฌธ๋งŒ ์ž˜ ๊ฑธ์–ด์ฃผ๋ฉด ํ•ด๊ฒฐ๋˜๋Š” ๋ฌธ์ œ

 

์ฃผ์˜ํ• ์ ์€ ์ฃผ์–ด์ง„ board๊ธธ์ด/2 ์— ํ•ด๋‹นํ•˜๋Š” ๊ฐ’๊นŒ์ง€๋งŒ ์›€์ง์ผ ์ˆ˜ ์žˆ๋‹ค๋Š”๊ฒƒ ( ์Œ์ˆ˜ ์ฒ˜๋ฆฌ ์‹ ๊ฒฝ์“ฐ๊ธฐ )

 

 

class Solution {
    public int[] solution(String[] keyinput, int[] board) {
        int[] answer = {0,0};

        for(int i=0; i<keyinput.length; i++){
            // key input = left or right-> answer[0]
            if(keyinput[i].equals("left")||keyinput[i].equals("right")){
                if(keyinput[i].equals("left")){
                    if(answer[0]>-(board[0]/2))
                        answer[0]--;
                }else{
                    if(answer[0]<board[0]/2)
                        answer[0]++;
                }
            // key input = down or up -> answer[1]     
            }else{
                if(keyinput[i].equals("down")){
                    if(answer[1]> -(board[1]/2))
                        answer[1]--;
                }else{
                    if(answer[1]<board[1]/2)
                        answer[1]++;
                }
            }
        }
        return answer;
    }
}