import java.util.*; class Solution { public int solution(int[] arr) { int answer = 1; Arrays.sort(arr); List value = new ArrayList(); int max = arr[arr.length-1]; for(int i=2; i

class Solution { public int solution(String s) { int answer = 0; while(true){ String temp = s; for(int i=1; i bbaa > aa > null 이 되도록 s를 업데이트 시켜주며 null이 되면 1, 끝까지 읽었는데 null이아니면 0 이 되도록 짰다. 결과는 시간초과. import java.util.*; class Solution { public int solution(String s) { int answer = 0; Stack st = new Stack(); st.push(s.charAt(0)); for(int i=1; i

class Solution { public int solution(int[] nums) { int answer = 0; for(int i=0; i

import java.util.*; class Solution { int solution(int[][] land) { int answer = 0; int[][] dp = new int[land.length][4]; for(int i=0; i

import java.util.*; class Solution { public boolean solution(int[] arr) { boolean answer = true; Set s = new HashSet(); for(int i=0; i

import java.util.*; class Solution { public int solution(int [][]board) { int answer = 0; int[][] copy = new int[board.length+1][board[0].length+1]; for(int i=0; i