![프로그래머스 Lv.1 없는 숫자 더하기](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FLYTnx%2FbtsGnO5ynno%2FGvHwhDp23hqhyxhkXrgsn1%2Fimg.png)
class Solution { public int solution(int[] numbers) { int answer = 0; for (int i = 0; i < 10; i++) { answer += i; } fo..
![프로그래머스 Lv.1 나누어 떨어지는 숫자 배열](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FypAEX%2FbtsEeKZj9mn%2FU9nvoA6xVjo70H4WIrXKJk%2Fimg.png)
import java.util.*;class Solution { public int[] solution(int[] arr, int divisor) { int[] answer = Arrays.stream(arr) .filter(item -> (item % divisor) == 0) .sorted() ..
![프로그래머스 Lv.0 수열과 구간 쿼리 3](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2Fnb7nM%2FbtsEcr6wkjG%2FUC7By5DJ3x07WHmt7GAsnk%2Fimg.png)
class Solution { public int[] solution(int[] arr, int[][] queries) { for(int i = 0; i < queries.length; i++) { int idx1 = queries[i][0]; int idx2 = queries[i][1]; int tmp = arr[idx1]; arr[idx1] = arr[idx2]; arr[idx2] = tmp; } int[] answer = arr; return answer; } }
![프로그래머스 Lv.0 배열 만들기 5](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2Fbn23Nz%2FbtsEbBBoBqx%2FgBF7cQNlxntMwCEErDxqLK%2Fimg.png)
import java.util.*; class Solution { public int[] solution(String[] intStrs, int k, int s, int l) { return Arrays.stream(intStrs) .mapToInt(item -> Integer.parseInt(item.substring(s, s+l))) .filter(item -> k < item) .toArray(); } }
register.jsp 글쓰기 제목 작성자 내용 파일 업로드 등록 취소 detail.jsp No. 제목 작성자 작성일 ${bvo.readCount } 수정일 내용 수정 삭제 목록 ${authEmail } 등록 등록 Writer 댓글등록일 content 댓글 더보기 ${authEmail } 등록 닫기 boardComment.js console.log('boardComment.js in~!!'); console.log(bnoVal); console.log(userEmail); document.getElementById('cmtPostBtn').addEventListener('click',()=>{ const cmtText = document.getElementById('cmtText'); if(cmtText..