다시

package Twopointers_Slidingwindow; import java.util.Scanner; public class Ts03 { public int solution(int n, int m, int[] arr) { int answer = 0; int sum = 0; for(int i = 0; i < m; i++){ sum += arr[i]; } answer = sum; for(int i = m; i < n; i++) { sum = sum + arr[i] - arr[i - m]; // if(answer < sum) { // answer = sum; // } answer = Math.max(answer, sum); } return answer; } public static void main(S..

package Twopointers_Slidingwindow; import java.util.ArrayList; import java.util.Arrays; import java.util.List; import java.util.Scanner; public class Ts02 { public List solution(int n, int m, int[] a, int[] b) { List answer = new ArrayList(); int p1 = 0, p2 = 0; Arrays.sort(a); Arrays.sort(b); while(p1 < n && p2 < m) { if(a[p1] == b[p2]) { answer.add(a[p1]); p1++; p2++; } else if (a[p1] < b[p2])..

package Twopointers_Slidingwindow; import java.util.*; public class Ts01 { public List solution(int num1, int num2, int[] arr1, int[] arr2){ List answer = new ArrayList(); int p1 = 0, p2 = 0; // two pointer while (p1 < num1 && p2 < num2) { // 둘중하나가 num1, num2 가 되면 거짓이 됩니다. // 그래서 멈춥니다. if(arr1[p1] < arr2[p2]) { // ++ 이 뒤에있으면 p1을 add 하고 p1이 1 증가합니다. answer.add(arr1[p1]); p1++; } else { answer.add..

package Array; import java.util.Scanner; public class Array12 { public int solution(int people, int problem, int[][] arr) { int answer = 0; for(int i = 1; i