FilesExpand file tree

 master

/

SumMatrix.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

35 lines (31 loc) · 863 Bytes

 master

/

SumMatrix.java

Copy path

Top

File metadata and controls

• Code
• Blame

35 lines (31 loc) · 863 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

/*

* 2018.05.14

* 김지혜

* 행렬 덧셈 구하기

*/

package programmers;

class SumMatrix {

int[][] sumMatrix(int[][] A, int[][] B) {

int[][] answer = {{0, 0}, {0, 0}};

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

for(int i=0;i<answer.length;++i) {

for(int j=0;j<answer[i].length;++j) {

answer[i][j]=A[i][j]+B[i][j];

}

}

return answer;

}

// 아래는 테스트로 출력해 보기 위한 코드입니다.

public static void main(String[] args) {

SumMatrix c = new SumMatrix();

int[][] A = { { 1, 2 }, { 2, 3 } };

int[][] B = { { 3, 4 }, { 5, 6 } };

int[][] answer = c.sumMatrix(A, B);

if (answer[0][0] == 4 && answer[0][1] == 6 &&

answer[1][0] == 7 && answer[1][1] == 9) {

System.out.println("맞았습니다. 제출을 눌러 보세요");

} else {

System.out.println("틀렸습니다. 수정하는게 좋겠어요");

}

}

}