class Solution { public long solution(int price, int money, int count) { long answer = 0; for(int i = 1; i = answer){ return 0; }else{ return answer - money; } } }
import java.util.*; class Solution { public String solution(String s) { char[] charArray = s.toCharArray(); Arrays.sort(charArray); StringBuilder answer = new StringBuilder(new String(charArray)).reverse(); return answer.toString(); } }
class Solution { public int solution(int left, int right) { int answer = 0; for(int i = left; i
class Solution { public int solution(int[] a, int[] b) { int sum = 0; for(int i = 0; i < a.length; i++){ sum += a[i] * b[i]; } return sum; } }
class Solution { public String solution(int n) { StringBuilder sb = new StringBuilder(); for(int i = 0; i < n; i++){ if(i % 2 == 0){ sb.append("수"); }else{ sb.append("박"); } } return sb.toString(); } }
class Solution { public String solution(String s) { if(s.length() % 2 == 1){ return s.substring(s.length()/2, s.length()/2+1); }else{ return s.substring(s.length()/2-1,s.length()/2+1); } } } substring 을 이용하면 간단하게 표현할 수 있다!
import java.util.*; class Solution { public int[] solution(int[] arr) { int[] answer = new int[arr.length - 1]; if(arr.length == 1){ return new int[] {-1}; } int min = Integer.MAX_VALUE; int idx = 0; for(int i = 0; i < arr.length; i++){ if(arr[i] < min ){ min = arr[i]; idx = i; } } int j = 0; for(int i = 0; i < arr.length; i++){ if(i != idx){ answer[j++] = arr[i]; } } return answer; } } 최솟값의 인덱스..
class Solution { public int solution(int[] numbers) { int answer = 45; for(int i = 0; i < numbers.length; i++){ answer -= numbers[i]; } return answer; } } 전체 숫자에서 numbers의 배열의 숫자를 전부 빼주면 쉽게 풀 수 있는 문제다!
class Solution { public int solution(int[] absolutes, boolean[] signs) { int answer = 0; for(int i = 0; i < absolutes.length; i++){ if(!signs[i]){ absolutes[i] = -absolutes[i]; answer += absolutes[i]; }else{ answer += absolutes[i]; } } return answer; } }
class Solution { public String solution(String[] seoul) { String answer = ""; for(int i = 0; i < seoul.length; i++){ if(seoul[i].equals("Kim")){ return "김서방은 " + i + "에 있다"; } } return answer; } }
