목록JavaAlgorithm (47)
KSI일기장
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/d4vTHP/btsA8Nx37j3/SFXO3APbRKKhJU5wfS2wT1/img.png)
public static void main(String[] args) { int hp = 999; int answer = 0; if((hp%5)==0){ answer = hp/5; } else if ( (((hp%5)%3)==0) && ((hp%5) >= 3) ) { answer = (hp/5) + ((hp%5)/3); }else{ answer=(hp/5) + ((hp%5)/3) + (((hp%5)%3)/1); } System.out.println(answer); } public static void main(String[] args) { int hp = 24; int answer = 0; answer = (hp/5) + ((hp%5) / 3) + ((hp%5) % 3); System.out.printl..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/zZy7c/btsA9R1cuf6/GZUruhTvbhg4sbFH8e9Vh0/img.png)
public static void main(String[] args) { // String cipher = "pfqallllabwaoclk"; // int code = 2; String cipher = "dfjardstddetckdaccccdegk"; int code = 4; String answer = ""; for(int i=1; i
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/1xchz/btsA7Sy6U4R/KW6op5szjiKrFidDoVD49K/img.png)
public static void main(String[] args) { String my_string = "cccCCC"; String answer = ""; //문자열 하나씩 접근해 대소문자 확인 후 변환하기 for(int i=0; i
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/P8wtS/btsA1d4UX8G/1hugfvOBwlF7TWeixkb7BK/img.png)
import java.util.*; class Solution { public int[] solution(int n, int[] numlist) { int[] answer = Arrays.stream(numlist) .filter(num -> num % n == 0) .toArray(); return answer; } } class Solution { public int[] solution(int n, int[] numlist) { int count = 0; // numlist에서 n의 배수인 개수만큼 배열크기 지정해서 생성 for(int i=0; i
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/dFWaNs/btsAYHYv1OB/HNn9qLgc9T1JMkBmqL2kp0/img.png)
class Solution { public int solution(int n, int t) { for(int i=1; i
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/bu34zD/btsA27oHqyv/UujH155fCqtVQ5MNiyMEV1/img.png)
class Solution { public int solution(String my_string) { //영어 잘라버리기 String ms = my_string.replaceAll("[a-zA-Z]", ""); //숫자만 남아있는 String을 배열로 변환 String[] arr = ms.split(""); //총합 int answer = 0; for(int i=0; i
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/bqrsjR/btszlF9J00R/nrBUohgdFKJLjFywHhq640/img.png)
class Solution { public int[] solution(int n) { int[] answer = new int[(n+1)/2]; //배열 크기 설정 int a = 0; //배열 인덱스를 위한 변수 생성 for(int i=0; i