![프로그래머스 Lv.0 빈 배열에 추가, 삭제하기](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2Fb3LIen%2FbtsDW4Ybviw%2FEMyKgRDvKSDKLgDiSpS0IK%2Fimg.png)
import java.util.*; class Solution { public int[] solution(int[] arr, boolean[] flag) { ArrayList list = new ArrayList (); for(int i = 0; i < flag.length; i++) { if(flag[i]) { for(int j = 0; j < arr[i] * 2; j++) { list.add(arr[i]); } }else { for(int j = 0; j < arr[i]; j++) { list.remove(list.size()-1); } } } int answer[] = new int [list.size()]; for(int i = 0; i < list.size(); i++) { answer[i] =..
![프로그래머스 Lv.0 문자열 뒤집기](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2Fdw3zWO%2FbtsDZlw73PO%2F1s3co2Q2epSF8PwnKcwkGk%2Fimg.png)
class Solution { public String solution(String my_string, int s, int e) { String answer = ""; int idx = 0; String revStr = new StringBuilder(my_string.substring(s, e+1)).reverse().toString(); for(int i = 0; i = s && i
![프로그래머스 Lv.0 글자 지우기](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FsCVFu%2FbtsDQYRxXn2%2F1APVlrmZnpKetDRcuWXlB0%2Fimg.png)
class Solution { public String solution(String my_string, int[] indices) { String answer = ""; String[] strArr = my_string.split(""); for(int idx : indices) { strArr[idx] = ""; } for(String str : strArr) { answer += str; } return answer; } }
![프로그래머스 Lv.0 날짜 비교하기](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2F2FqQd%2FbtsDWrdnJ0I%2FMSHcXEkGQryXS4BiRlCTJ1%2Fimg.png)
class Solution { public int solution(int[] date1, int[] date2) { int answer = 0; for(int i = 0; i date2[i]) { break; } else if (date1[i] == date2[i]) { answer = 0; } else { answer = 1; } } return answer; } }
![프로그래머스 Lv.0 수열과 구간 쿼리 1](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FcUoHAW%2FbtsDT2kiTyK%2FV44g8qm1XyHcGZtiW8GKpK%2Fimg.png)
class Solution { public int[] solution(int[] arr, int[][] queries) { int[] answer = new int [arr.length]; for(int[] query : queries) { int num1 = query[0]; int num2 = query[1]; for(int i = 0; i = query[0] && i