매일 조금씩

오랜만에 char와 ascii를 찾아본 문제 valueOf()로 형변환, contains로 String에서 String 찾기 class Solution { public String solution(String s, String skip, int index) { String answer = ""; for(int i = 0 ; i 'z') c -= 26; if(skip.contains(String.valueOf(c))) j--; } answer += c; } return answer; } }

class Solution { public String solution(String[] cards1, String[] cards2, String[] goal) { String answer = "Yes"; int idx1 = 0; int idx2 = 0; for(int i = 0; i < goal.length; i++){ if(goal[i].equals(cards1[idx1])) { if(idx1 != cards1.length - 1) idx1++; }else if(goal[i].equals(cards2[idx2])) { if(idx2 != cards2.length - 1) idx2++; }else { answer = "No"; break; } } return answer; } }

class Solution { boolean solution(String s) { boolean answer = true; String[] str = s.split(""); int p = 0; int y = 0; for(int i=0; i

import java.util.*; public class Solution { public int solution(int n) { int answer = 0; String m = Integer.toString(n); for(int i = 0; i

import java.util.*; class Solution { public int[] solution(long n) { String[] str = new Long(n).toString().split(""); int length = str.length; int[] answer = new int[length]; for(int i = 0; i < length; i++) { answer[length - 1 - i] = Integer.parseInt(str[i]); } return answer; } }

import java.lang.Math; class Solution { public long solution(long n) { long answer = 0; double result = Math.sqrt(n); if(result % 1 != 0) answer = -1; else answer = ((long)result+1)*((long)result+1); return answer; } }