[DataStructure&Algorithm] 멘토링

section : Array

 

풀이 1

import java.util.Scanner;

public class Main {
public int solution(int n, int m, int[][] arr){ // 3, 4
int answer = 0;
for(int i=1; i<=n; i++){
for(int j=1; j<=n; j++){
int cnt=0;
for(int k=0; k<m; k++){
int pi=0, pj=0;
for(int s=0; s<n; s++){
if(arr[k][s]==i) pi=s;
if(arr[k][s]==j) pj=s;
}
if(pi<pj) cnt++;
}
if(cnt==m){
answer++;
}
}
}

return answer;
}

public static void main(String[] args){
Main m = new Main();
Scanner scanner = new Scanner(System.in);
int n2 = scanner.nextInt(); //열4
int n1 = scanner.nextInt(); //행3
int[][] ia = new int[n1][n2]; //행3,열4

for(int i=0; i<n1; i++){
for(int j=0; j<n2; j++){
ia[i][j] = scanner.nextInt();
}
}
System.out.println(m.solution(n2, n1, ia));
}
}

 

comment : Array에서 가장 어려웠다