코딩아 재윤해

class Solution { boolean solution(String s) { char[] charArray = s.toCharArray(); int count = 0; for(int i = 0; i < charArray.length; i++){ if(count < 0) return false; if(charArray[i] == '(') count++; else{ count--; } } if(count == 0) return true; else return false; } }

class Solution { public int solution(String t, String p) { int answer = 0; Long pNum = Long.parseLong(p); char[] arr = t.toCharArray(); for (int i = 0; i

class Solution { public int solution(int[][] sizes) { int max1 = 1; int max2 = 1; for (int[] i : sizes) { max1 = Math.max(max1, Math.max(i[0], i[1])); max2 = Math.max(max2, Math.min(i[0], i[1])); } return max1 * max2; } }

import java.util.*; class Solution { public int solution(int[] d, int budget) { Arrays.sort(d); int count = 0; for (int i : d) { if (budget - i >= 0) { budget -= i; count++; } } return count; } }

class Solution { public String solution(String s, int n) { StringBuilder sb = new StringBuilder(); char[] arr = s.toCharArray(); for (int i = 0; i = 'A' && arr[i] = 'a' && arr[i]

import java.util.*; class Solution { public String solution(String s) { String[] arr = s.split(""); StringBuilder sb = new StringBuilder(); int idx = 0; for (int i = 0; i < arr.length; i++) { if (arr[i].equals(" ")) { sb.append(" "); idx = 0; } else if ((idx + 1) % 2 == 1) { sb.append(arr[i].toUpperCase()); idx++; } else { sb.append(arr[i].toLowerCase()); idx++; } } return sb.toString(); } }

import java.util.Scanner; class Solution { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); int b = sc.nextInt(); for (int i = 0; i < b; i++) { System.out.println("*".repeat(a)); } } }

class Solution { public long solution(int price, int money, int count) { long sum = 0; for (int i = 1; i 0 ? 0 : Math.abs(money - sum); } } 처음에 돈이 부족하지 않은 경우를 고려하지 않아서 테스트 케이스 4번을 통과하지 못했던 것 같다.

class Solution { public boolean solution(String s) { if (s.length() != 4 && s.length() != 6) return false; for (int i = 0; i '9') return false; } return true; } }

class Solution { public int solution(int left, int right) { int answer = 0; for (int i = left; i