codingtest161 [Programmers] Lv.0 / 수열과 구간 쿼리 4 / Java 문제 풀이 import java.util.*; class Solution { public int[] solution(int[] arr, int[][] queries) { for(int i = 0; i < queries.length; i++) { int s = queries[i][0]; int e = queries[i][1]; int k = queries[i][2]; for(int j = s; j 2023. 10. 19. [Programmers] Lv.0 / 수열과 구간 쿼리 2 / Java 문제 풀이 import java.util.ArrayList; import java.util.Arrays; class Solution { public int[] solution(int[] arr, int[][] queries) { int[] answer = new int[queries.length]; Arrays.fill(answer, -1); for (int i = 0; i < queries.length; i++) { int s = queries[i][0]; int e = queries[i][1]; int k = queries[i][2]; int minGreaterValue = Integer.MAX_VALUE; for (int j = s; j k && arr[j] < minGreaterValue) { m.. 2023. 10. 18. [Programmers] Lv.0 / 수열과 구간 쿼리 3 / Java 문제 풀이 class Solution { public int[] solution(int[] arr, int[][] queries) { int temp; for(int i = 0; i < queries.length; i++) { temp = arr[queries[i][0]]; arr[queries[i][0]] = arr[queries[i][1]]; arr[queries[i][1]] = temp; } return arr; } } import java.util.Arrays; class Solution { public int[] solution(int[] arr, int[][] queries) { int[] answer = Arrays.copyOf(arr, arr.length); for (int[] query .. 2023. 10. 18. [Programmers] Lv.0 / 수 조작하기 2 / Java 문제 풀이 class Solution { public String solution(int[] numLog) { String answer = ""; int first = 0; int second = 0; for(int i = 0; i < numLog.length - 1; i++) { first = numLog[i]; second = numLog[i + 1]; if(first + 1 == second) { answer += "w"; } else if(first - 1 == second) { answer += "s"; } else if(first + 10 == second) { answer += "d"; } else if(first - 10 == second) { answer += "a"; } } return.. 2023. 10. 18. [Programmers] Lv.0 / 수 조작하기 1 / Java 문제 풀이 class Solution { public int solution(int n, String control) { char[] charArray = control.toCharArray(); for(Character ch : charArray) { if(ch.equals('w')) { n += 1; } else if(ch.equals('s')) { n -= 1; } else if(ch.equals('d')) { n += 10; } else if(ch.equals('a')) { n -= 10; } } return n; } } class Solution { public int solution(int n, String control) { for (char ch : control.toCharArray()).. 2023. 10. 18. [Programmers] Lv.0 / 마지막 두 원소 / Java 문제 풀이 class Solution { public int[] solution(int[] num_list) { int size = num_list.length; int[] answer = new int[size + 1]; System.arraycopy(num_list, 0, answer, 0, size); int lastNum = num_list[size - 1]; int lastSecondNum = num_list[size - 2]; if(lastNum > lastSecondNum) { answer[size] = lastNum - lastSecondNum; } else { answer[size] = lastNum * 2; } return answer; } } 출처 https://school.progr.. 2023. 10. 18. [Programmers] Lv.0 / 원소들의 곱과 합 / Java 문제 풀이 class Solution { public int solution(int[] num_list) { int answer = 0; int multiplied = 1; int sumSquared = 0; for(int num : num_list) { multiplied *= num; sumSquared += num; } sumSquared *= sumSquared; // Math.pow(sumSquared, 2); answer = multiplied < sumSquared ? 1 : 0; return answer; } } import java.util.Arrays; class Solution { public int solution(int[] numList) { return (Arrays.stream.. 2023. 10. 18. [Programmers] Lv.0 / 주사위 게임 2 / Java 문제 풀이 class Solution { public int solution(int a, int b, int c) { int answer = a + b + c; if(a == b && b == c) { answer = (a + b + c) * (a * a + b * b + c * c) * (a * a * a + b * b * b + c * c * c); } else if((a == b && b != c) || (a != b && b == c) || (a == c && c != b)) { answer = (a + b + c) * (a * a + b * b + c * c); } return answer; } } class Solution { public int solution(int a, int b, int.. 2023. 10. 18. [Programmers] Lv.0 / 등차수열의 특정한 항만 더하기 / Java 문제 풀이 class Solution { public int solution(int a, int d, boolean[] included) { int answer = 0; for(int i = 0; i included[idx] ? a + (idx * d) : 0.. 2023. 10. 18. [Programmers] Lv.0 / 코드 처리하기 / Java 문제 풀이 class Solution { public String solution(String code) { String answer = ""; int mode = 0; for(int i = 0; i < code.length(); i++) { String a = code.substring(i, i + 1); if(mode == 0) { if(!a.equals("1")) { if(i % 2 == 0) { answer += a; } } else { mode = 1; } } else { if(!a.equals("1")) { if(i % 2 == 1) { answer += a; } } else { mode = 0; } } } if(answer.equals("")) { answer = "EMPTY"; } retu.. 2023. 10. 18. [Programmers] Lv.0 / flag에 따라 다른 값 반환하기 / Java 문제 풀이 class Solution { public int solution(int a, int b, boolean flag) { int answer = 0; if(flag) { answer = a + b; } else { answer = a - b; } return answer; } } class Solution { public int solution(int a, int b, boolean flag) { return flag ? a + b : a - b; } } 출처 https://school.programmers.co.kr/learn/courses/30/lessons/181933 2023. 10. 18. [Programmers] Lv.0 / 조건 문자열 / Java 문제 풀이 class Solution { public int solution(String ineq, String eq, int n, int m) { int answer = 0; if(ineq.equals(">")) { if(eq.equals("=")) { return n >= m ? 1 : 0; } else if(eq.equals("!")) { return n > m ? 1 : 0; } } else if(ineq.equals("=", (a, b) -> a >= b, "!", (a, b) -> a > b, " 2023. 10. 18. 이전 1 ··· 9 10 11 12 13 14 다음
