Hamutaro - Hamtaro 4

Algorithm/Programmers

[LV1/JAVA] ํ–‰๋ ฌ์˜ ๋ง์…ˆ

carsumin 2024. 9. 3. 22:47

 

https://school.programmers.co.kr/learn/courses/30/lessons/12950

 

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”.

programmers.co.kr

 

 

1. ์˜ˆ์ „์— ํ•™๊ต์—์„œ C์–ธ์–ด ๋ฐฐ์šธ ๋•Œ ์ดํ›„๋กœ ์˜ค๋žœ๋งŒ์— ๋ณด๋Š” 2์ฐจ์› ๋ฐฐ์—ด... ์‹ค๋ฌด์—์„œ๋Š” ๊ฑฐ์˜ ์“ธ ์ผ์ด ์—†์—ˆ๋‹ค.

2. ํ—ท๊ฐˆ๋ ค์„œ ๋ฐฐ์—ด ์š”์†Œ์— ๋Œ€ํ•œ ๊ทธ๋ฆผ์„ ๊ทธ๋ฆฌ๋ฉฐ ํ’€์—ˆ๋‹ค.

 

๋‚˜์˜ ํ’€์ด
class Solution {
    public int[][] solution(int[][] arr1, int[][] arr2) {
        int[][] answer = new int[arr1.length][arr1[0].length];
        
        for(int i=0; i<arr1.length; i++){
            for(int j=0; j<arr1[i].length; j++){
                answer[i][j] = arr1[i][j] + arr2[i][j];
            } 
        } 
        
        return answer;
    }
}

 

 

์ฒ˜์Œ์— answer ๋ฐฐ์—ด์„ ์„ ์–ธํ•  ๋•Œ ๋ฐฐ์—ด์˜ ํฌ๊ธฐ๋ฅผ ์•„๋ž˜์™€ ๊ฐ™์ด ํ–ˆ๋”๋‹ˆ ํ…Œ์ŠคํŠธ ์ผ€์ด์Šค 2๋ฅผ ํ†ต๊ณผํ•˜์ง€ ๋ชปํ–ˆ๋‹ค.

int[][] answer = new int[arr1.length][arr2.length];

 

 

ํ…Œ์ŠคํŠธ ์ผ€์ด์Šค 2์—์„œ [[4], [6]] ์ด๋ ‡๊ฒŒ ์ถœ๋ ฅ์ด ๋ผ์•ผ ํ•˜๋Š”๋ฐ [[4,0],[6,0]] ์ด๋Ÿฐ์‹์œผ๋กœ ์‹คํ–‰๊ฒฐ๊ณผ๊ฐ€ ๋‚˜์™”๋‹ค.

์•„๋ž˜์™€ ๊ฐ™์ด ์—ด์˜ ํฌ๊ธฐ๋ฅผ ํ–‰์˜ ํฌ๊ธฐ์™€ ๋งž์ถฐ์ค˜์•ผ ๊ธฐ๋Œ“๊ฐ’๋Œ€๋กœ ์ถœ๋ ฅํ•  ์ˆ˜ ์žˆ๋‹ค.

int[][] answer = new int[arr1.length][arr1[0].length];