DataStructure&Algorithm (52) 썸네일형 리스트형 [DataStructure&Algorithm] 연속 부분 수열 section : two pointers 풀이 1 import java.util.Scanner; public class Main { public int solution(int n, int k, int[] a){ int p1 = 0, p2 = 1, tmp = 0, answer = 0; tmp = a[p1]; while(p2 k){ ++p1; p2 = p1+1; tmp = a[p1]; } } return answer; } public static void main(String[] args){ Main m = new Main(); Scanner scanner = new Scanner(System.in); int n = scanner.nextInt(); int k = scanner.nextInt(); int[].. [DataStructure&Algorithm] 최대 매출 section : two pointers 풀이 1 import java.util.Scanner; public class Main { public int solution(int n, int k, int[] a){ int answer = 0, tmp = 0; int p1 = 0, p2 = k-1; for(int i=0; i [DataStructure&Algorithm] 공통원소 구하기 section : two pointers 잘못된 풀이 import java.util.ArrayList; import java.util.Scanner; import java.util.Collections; public class Main { public ArrayList solution(int n1, int n2, int[] a, int[] b){ ArrayList answer = new ArrayList(); for(int i=0; i [DataStructure&Algorithm] 두 배열 합치기 section : two pointers 풀이 1 import java.util.ArrayList; import java.util.Scanner; public class Main { public ArrayList solution(int n1, int n2, int[] a, int[] b){ ArrayList answer = new ArrayList(); int p1=0, p2=0; while(p1 [DataStructunre&Algorithm] 봉우리 section : Array 풀이 1 import java.util.Scanner; public class Main { public int solution(int n, int[][] arr){ int[] dy={0, 1, 0, -1}; int[] dx={-1, 0, 1, 0}; int answer = 0; for(int i=0; i [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 [DataStructure&Algorithm] 임시반장정하기 section : Array 풀이 1 import java.util.Scanner; public class Main { public int solution(int num, int[][] ia){ int[] cnt = new int[num]; for(int i=0; i [DataStructure&Algorithm] 격자판 최대합 section : Array 풀이 1 import java.util.Scanner; public class Main { public int solution(int num, int[][] ia){ int answer = 0, tmp1 = 0, tmp2 = 0, tmp3 = 0, tmp4 = 0; for(int i=0; ianswer) answer=tmp2; tmp1=0; tmp2=0; tmp3 += ia[i][i]; tmp4 += ia[0+i][num-i-1]; } if (tmp3>answer) answer=tmp3; if (tmp4>answer) answer=tmp4; return answer; } public static void main(String[] args){ Main m = new Main().. 이전 1 2 3 4 5 6 7 다음
