Merge pull request #7 from algorithm-cote-study/yeji/week3

인프런 3주차

Author: seunggulee1007

src/main/java/sgyj/inflearn/study/week3/Solution21.java

@@ -0,0 +1,41 @@
+package sgyj.inflearn.study.week3;
+
+import java.util.Scanner;
+
+public class Solution21 {
+
+    public static void main ( String[] args ) {
+        Solution21 solution21 = new Solution21();
+        Scanner scanner = new Scanner( System.in );
+        int n = scanner.nextInt();
+        int[][] arr = new int[n][n];
+        for ( int i = 0; i < arr.length; i++ ) {
+            for ( int j = 0; j < arr.length; j++ ) {
+                arr[i][j] =  scanner.nextInt();
+            }
+        }
+        System.out.println(solution21.solution(n,arr));
+    }
+
+    private int solution ( int n, int[][] arr ) {
+        int answer = Integer.MIN_VALUE;
+        int sum1, sum2;
+        for(int i = 0; i<n; i++){
+            sum1 = sum2 = 0;
+            for(int j = 0; j<n; j++){
+                sum1 += arr[i][j];
+                sum2 += arr[j][i];
+            }
+            answer=Math.max( answer, sum1);
+            answer=Math.max( answer, sum2 );
+        }
+        sum1=sum2=0;
+        for(int i=0; i<n; i++){
+            sum1+=arr[i][i];
+            sum2+=arr[i][n-i-1];
+        }
+        answer=Math.max( answer, sum1 );
+        answer=Math.max( answer,sum2 );
+        return answer;
+    }
+}

src/main/java/sgyj/inflearn/study/week3/Solution22.java

@@ -0,0 +1,40 @@
+package sgyj.inflearn.study.week3;
+
+import java.util.Scanner;
+
+public class Solution22 {
+
+    static int[] dx = {-1,0,1,0};
+    static int[] dy = {0,1,0,-1};
+    public static int solution ( int n, int[][] arr ){
+        int answer = 0;
+        for ( int i = 0; i < arr.length; i++ ) {
+            for ( int j = 0; j < arr.length; j++ ) {
+                boolean flag = true;
+                for(int k=0; k<4; k++){
+                    int nx = i+dx[k];
+                    int ny = j+dy[k];
+                    if(nx>=0 && nx<n && ny>=0 && ny<n &&  arr[nx][ny]>=arr[i][j]){
+                        flag=false;
+                        break;
+                    }
+                }
+                if(flag) answer++;
+            }
+        }
+        return answer;
+    }
+
+    public static void main ( String[] args ) {
+        Solution21 solution21 = new Solution21();
+        Scanner scanner = new Scanner( System.in );
+        int n = scanner.nextInt();
+        int[][] arr = new int[n][n];
+        for ( int i = 0; i < arr.length; i++ ) {
+            for ( int j = 0; j < arr.length; j++ ) {
+                arr[i][j] =  scanner.nextInt();
+            }
+        }
+        System.out.println(solution(n,arr));
+    }
+}

src/main/java/sgyj/inflearn/study/week3/Solution23.java

@@ -0,0 +1,39 @@
+package sgyj.inflearn.study.week3;
+
+import java.util.Scanner;
+
+public class Solution23 {
+
+    public static int solution ( int n, int[][] arr ){
+        int answer = 0, max=Integer.MIN_VALUE;
+        for(int i = 1; i<=n; i++){
+            int cnt = 0;
+            for(int j=1; j<=n; j++){
+                for(int k=1; k<=5; k++){
+                    if(arr[i][k] == arr[j][k]){
+                        cnt++;
+                        break;
+                    }
+                }
+            }
+            if(cnt>max){
+                max=cnt;
+                answer=i;
+            }
+        }
+        return answer;
+    }
+
+    public static void main(String[] args){
+        Scanner scanner = new Scanner( System.in );
+        int n = scanner.nextInt();
+        int[][] input = new int[n+1][6];
+        for(int i=0; i<n; i++){
+            for(int j=1; j<=5; j++){
+                input[i][j] = scanner.nextInt();
+            }
+        }
+        System.out.println(solution( n, input ));
+    }
+
+}

src/main/java/sgyj/inflearn/study/week3/Solution24.java

@@ -0,0 +1,44 @@
+package sgyj.inflearn.study.week3;
+
+import java.util.Scanner;
+
+public class Solution24 {
+
+    public static int solution ( int n, int m, int[][] arr ){
+        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){
+        Scanner sc = new Scanner( System.in );
+        String[] input = sc.nextLine().split( " " );
+        int n = Integer.parseInt(input[0]);
+        int m = Integer.parseInt( input[1] );
+        int[][] inputValue = new int[m][n];
+
+        for(int i=0; i<m; i++){
+            for(int j=0; j<n; j++){
+                inputValue[i][j] = sc.nextInt();
+            }
+        }
+        System.out.println(solution(n,m,inputValue));
+    }
+
+}

src/main/java/sgyj/inflearn/study/week3/Solution25.java

@@ -0,0 +1,37 @@
+package sgyj.inflearn.study.week3;
+
+import java.util.ArrayList;
+import java.util.Scanner;
+
+public class Solution25 {
+
+    public static ArrayList<Integer> solution(int n,int m, int[] a, int[] b){
+        ArrayList<Integer> answer = new ArrayList<>();
+        int p1=0,p2=0;
+
+        while ( p1<n && p2<m ){
+            if(a[p1]<b[p2]) answer.add( a[p1++] );
+            else answer.add(b[p2++]);
+        }
+        while ( p1<n ) answer.add( a[p1++] );
+        while ( p2<m ) answer.add( b[p2++] );
+        return answer;
+    }
+
+    public static void main ( String[] args ) {
+        Scanner scanner = new Scanner( System.in );
+        int n = scanner.nextInt();
+        int[] a = new int[n];
+        for(int i=0; i<n; i++){
+            a[i] = scanner.nextInt();
+        }
+        int m = scanner.nextInt();
+        int[] b = new int[m];
+        for(int i=0; i<m; i++){
+            b[i] = scanner.nextInt();
+        }
+        for(int x : solution(n,m,a,b)) System.out.print(x + " ");
+
+    }
+
+}

src/main/java/sgyj/inflearn/yeji/week3/Solution21.java

@@ -0,0 +1,46 @@
+package sgyj.inflearn.yeji.week3;
+
+import java.util.Scanner;
+
+public class Solution21 {
+
+    public static int solution(int n, int[][] input){
+        int answer = 0;
+
+        for(int i=0; i<n; i++){
+            int index = 0;
+            int garo = 0;
+            int sero = 0;
+            while (index < n){
+                garo += input[i][index];
+                sero += input[index][i];
+                index++;
+            }
+            if(garo > sero && answer < garo) answer = garo;
+            else if(garo < sero && answer < sero) answer = sero;
+        }
+        int compare1 = 0;
+        int compare2 = 0;
+        for(int i=0; i<n; i++){
+            compare1 += input[i][i];
+            compare2 += input[i][n-1-i];
+        }
+        if(compare1 > answer) answer = compare1;
+        if(compare2 > answer) answer = compare2;
+        return answer;
+
+    }
+
+    public static void main(String[] args){
+        Scanner scanner = new Scanner( System.in );
+        int n = scanner.nextInt();
+        int[][] input = new int[n][n];
+        for(int i = 0; i<n; i++){
+            for(int j = 0; j<n; j++){
+                input[i][j] = scanner.nextInt();
+            }
+        }
+        System.out.println(solution( n,input ));
+
+    }
+}

src/main/java/sgyj/inflearn/yeji/week3/Solution22.java

@@ -0,0 +1,35 @@
+package sgyj.inflearn.yeji.week3;
+
+import java.util.Scanner;
+
+public class Solution22 {
+
+    public static int solution(int n, int[][] input){
+        int answer = 0;
+        for(int i = 1; i<input.length-1; i++){
+            for(int j=1; j<input.length-1; j++){
+                int checkValue = Math.max(Math.max( input[i+1][j],input[i-1][j] ),Math.max( input[i][j+1],input[i][j-1] ));
+                if(input[i][j] > checkValue) {
+                    answer++;
+                }
+            }
+        }
+        return answer;
+    }
+
+    public static void main(String[] args){
+        Scanner in=new Scanner( System.in);
+        int n = in.nextInt();
+        int[][] input = new int[n+2][n+2];
+        for(int i = 0; i<=n+1; i++){
+            for(int j = 0; j<=n+1; j++){
+                if(i == 0 || j == 0 ||  i == n+1 || j == n+1){
+                    input[i][j] = 0;
+                }else{
+                    input[i][j] = in.nextInt();
+                }
+            }
+        }
+        System.out.print(solution( n,input ));
+    }
+}

src/main/java/sgyj/inflearn/yeji/week3/Solution23.java

@@ -0,0 +1,80 @@
+package sgyj.inflearn.yeji.week3;
+
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.HashSet;
+import java.util.LinkedHashMap;
+import java.util.List;
+import java.util.Map;
+import java.util.Scanner;
+import java.util.Set;
+
+public class Solution23 {
+
+    public static void main(String[] args){
+        Scanner scanner = new Scanner( System.in );
+        int n = scanner.nextInt();
+        int[][] input = new int[5][n];
+        for(int i=0; i<n; i++){
+            for(int j=0; j<5; j++){
+                input[j][i] = scanner.nextInt();
+            }
+        }
+        System.out.println(solution( input ));
+    }
+
+    public static int solution(int[][] input){
+        int answer = Integer.MAX_VALUE;
+        Set<String> resultGroupingMember = new HashSet<>();
+        Map<String, Integer> resultMap = new LinkedHashMap<>();
+        for ( int i = 0; i < input.length; i++ ) {
+            int[] ints = input[i];
+            Set<String> groupingMember = findGroupingMember( ints );
+            if(!groupingMember.isEmpty()){
+                resultGroupingMember.addAll( groupingMember );
+            }
+        }
+
+        for(String member : resultGroupingMember){
+            String[] s = member.split( " " );
+            String first = s[0];
+            String second = s[1];
+            if(resultMap.containsKey( first )){
+                resultMap.put( first, resultMap.get( first )+1 );
+            }else{
+                resultMap.put( first,1 );
+            }
+
+            if(resultMap.containsKey( second )){
+                resultMap.put( second, resultMap.get( second )+1 );
+            }else{
+                resultMap.put( second, 1 );
+            }
+        }
+
+        int maxCount = 0;
+        if(resultMap.isEmpty()) return 1;
+        for(String key : resultMap.keySet()){
+            if(resultMap.get( key )>maxCount){
+                maxCount = resultMap.get( key );
+                answer = Integer.parseInt( key );
+            }else if(resultMap.get(key) == maxCount  &&  Integer.parseInt( key ) < answer){
+                answer = Integer.parseInt( key );
+            }
+        }
+        return answer;
+    }
+
+    public static Set<String> findGroupingMember ( int[] groupingMember ){
+        Set<String> resultMember = new HashSet<>();
+        for ( int i = 0; i < groupingMember.length; i++ ) {
+            for(int j = i+1; j< groupingMember.length; j++){
+                if(groupingMember[i] == groupingMember[j]){
+                    resultMember.add( (i+1)+" "+(j+1)  );
+                }
+            }
+        }
+
+        return resultMember;
+    }
+}