์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | 7 |
8 | 9 | 10 | 11 | 12 | 13 | 14 |
15 | 16 | 17 | 18 | 19 | 20 | 21 |
22 | 23 | 24 | 25 | 26 | 27 | 28 |
29 | 30 | 31 |
- ํจ์คํธ์บ ํผ์ค ์ปดํจํฐ๊ณตํ ์์ฃผ๋ฐ
- http
- ๋๋ฆผ์ฝ๋ฉ
- HTTP ์๋ฒฝ๊ฐ์ด๋
- ์ง ๊ตฌํ๊ธฐ
- ๊น์ํ JPA
- js promise
- JPA ์ฐ๊ด๊ด๊ณ ๋งคํ
- js array
- ์ดํํฐ๋ธ์๋ฐ
- ์ดํํฐ๋ธ์๋ฐ ์คํฐ๋
- java
- BOJ
- Quick Sort
- ๋ฐฑ๊ธฐ์ ์คํฐ๋
- REST API
- ์ดํํฐ๋ธ์๋ฐ ์์ดํ 59
- ํ๋ก๊ทธ๋๋จธ์ค
- Spring Security
- ์ค๋ ๋
- ๋ฐฑ์ค
- ์ดํํฐ๋ธ์๋ฐ ์์ดํ 60
- js api
- HTTP ์๋ฒฝ ๊ฐ์ด๋
- ๊น์ํ http
- ์๋ฃ๊ตฌ์กฐ
- ๋ชจ๋์๋ฐ์คํฌ๋ฆฝํธ
- JS ๋ฅ๋ค์ด๋ธ
- dreamcoding
- ํ๋ก๊ทธ๋๋จธ์ค SQL
- Today
- 19
- Total
- 10,275
๋ชฉ๋กํ๋ก๊ทธ๋๋จธ์ค (8)
kingsubin
class Solution { public int solution(String s) { return Integer.valueOf(s); } } - ์ฑ๊ณต - ๊ทธ๋ฅ Integer.valueOf ํจ์๊ฐ ์๊ฐ๋ฌ๋ค
class Solution { public String solution(int n) { String su = "์"; String bak = "๋ฐ"; StringBuffer answer = new StringBuffer(); if (n == 1) { return su; } if (n % 2 == 0) { for (int i = 0; i < n/2; i++) { answer.append(su); answer.append(bak); } } else { for (int i = 0; i < n/2; i++) { answer.append(su); answer.append(bak); } answer.append(su); } return answer.toString(); } } - ์ฑ๊ณต - ์ฌ์ด๋ฌธ์ ๋ฐ ์ด๋ ต๊ฒ ํผ๊ฑฐ ๊ฐ..
class Solution { public static int solution(int n) { int count = 0; for (int i = 2; i
import java.util.Arrays; import java.util.Collections; class Solution { public static String solution(String s) { Character[] answer = new Character[s.length()]; String answer1 = ""; for (int i = 0; i < answer.length; i++) { answer[i] = s.charAt(i); } Arrays.sort(answer, Collections.reverseOrder()); for (int i = 0; i < answer.length; i++) { answer1 += Character.toString(answer[i]); } return answ..
class Solution { boolean solution(String s) { String lower = s.toLowerCase(); int pcnt = 1; int ycnt = 0; for (int i = 0; i < lower.length(); i++) { if (lower.charAt(i) == 'p') { pcnt++; } if (lower.charAt(i) == 'y') { ycnt++; } } return (pcnt-1) == ycnt; } } - ์ฑ๊ณต - p,y ๋ ๋ค ์๋์ค๋ ๊ฒฝ์ฐ๋ ์์ผ๋ pcnt = 1๋ก ์ฃผ๊ณ ํ์ด class Solution { boolean solution(String s) { s = s.toLowerCase(); int count = 0; for (int i =..
import java.util.Arrays; import java.util.Comparator; class Solution { public String[] solution(String[] strings, int n) { Arrays.sort(strings, new Comparator() { @Override public int compare(String o1, String o2) { if (o1.charAt(n) == o2.charAt(n)) { return o1.compareTo(o2); } else { return o1.charAt(n) - o2.charAt(n); } } }); return strings; } } - ์ฑ๊ณต - ์ ๋ฒ์ Comparator ์ฐ๋ ๋ฌธ์ ๋ฅผ ํ์ด๋ดค๋๋ ๋ฌธ์ ์ฝ๊ณ ์ด๊ฑฐ ์จ์ผ๊ฒ ๋ค๋..
class Solution { public long solution(int a, int b) { long big = Math.max(a, b); long small = Math.min(a, b); long answer = 0; for (long i = small; i
import java.util.ArrayList; import java.util.Arrays; class Solution { public int[] solution(int[] arr, int divisor) { ArrayList list = new ArrayList(); for (int i = 0; i < arr.length; i++) { if (arr[i] % divisor == 0) { list.add(arr[i]); } } if (list.size() == 0) { list.add(-1); } int[] answer = new int[list.size()]; for (int i = 0; i < list.size(); i++) { answer[i] = list.get(i); } Arrays.sort(..