개미 군단
package programmers.CodingBegginerTraining;
public class PROB3 {
public static void main(String[] args) {
int hp = 24;
System.out.println(solution (hp));
}
public static int solution(int hp) {
// 장군 개미 5, 병정 개미 3, 일개미 1
int answer = 0;
while (true) {
if (hp > 4) {
answer += hp / 5;
hp %= 5;
} else if (hp > 2) {
answer += hp / 3;
hp %= 3;
} else {
answer += hp;
break;
}
}
return answer;
}
}
Java
복사
가위바위보
package programmers.CodingBegginerTraining;
public class PROB4 {
public static void main(String[] args) {
String rsp = "2";
System.out.println(solution(rsp));
}
public static String solution(String rsp) {
// 가위는 2 바위는 0 보는 5로 표현
StringBuilder sb = new StringBuilder();
char[] chars = rsp.toCharArray();
for (int i = 0; i < chars.length; i++) {
if (chars[i] == '2') {
sb.append("0");
} else if (chars[i] == '0') {
sb.append("5");
} else if (chars[i] == '5') {
sb.append("2");
}
}
return sb.toString();
}
}
Java
복사
암호 해독
package programmers.CodingBegginerTraining;
public class PROB5 {
public static void main(String[] args) {
String cipher = "dfjardstddetckdaccccdegk";
int code = 4;
System.out.println(solution(cipher, code));
}
public static String solution(String cipher, int code) {
StringBuilder sb = new StringBuilder();
char[] chars = cipher.toCharArray();
int idx = code -1;
while (chars.length > idx ) {
sb.append(chars[idx]);
idx += code;
}
return sb.toString();
}
}
Java
복사
세균 증식
package programmers.CodingBegginerTraining;
public class PROB6 {
public static void main(String[] args) {
int n = 7;
int t = 15;
System.out.println(solution (n, t));
}
public static int solution (int n, int t) {
for (int i = 0; i < t; i++) {
n += n;
}
return n;
}
}
Java
복사
대문자와 소문자
package programmers.CodingBegginerTraining;
public class PROB7 {
public static void main(String[] args) {
String my_string = "cccCCC";
System.out.println(solution(my_string));
}
public static String solution (String my_string) {
StringBuilder sb = new StringBuilder();
char[] chars= my_string.toCharArray();
for (int i = 0; i < chars.length; i++) {
if (chars[i] >= 'a' && chars[i] <= 'z') {
sb.append(String.valueOf(chars[i]).toUpperCase());
} else if (chars[i] >= 'A' && chars[i] <= 'Z') {
sb.append(String.valueOf(chars[i]).toLowerCase());
}
}
return sb.toString();
}
}
Java
복사
주사위의 개수
class Solution {
public int solution(int[] box, int n) {
int a = box[0] / n;
int b = box[1] / n;
int h = box[2] / n;
return a * b * h;
}
}
Java
복사
최댓값 만들기(2)
package programmers.CodingBegginerTraining;
public class PROB8 {
public static void main(String[] args) {
int[] numbers = {1, 2, -3, 4, -5};
System.out.println(solution(numbers));
}
public static int solution(int[] numbers) {
int temp = 0;
for (int i = 0; i < numbers.length; i ++) {
for (int j = 0; j < numbers.length; j++) {
if (numbers[i] < numbers[j]) {
temp = numbers[i];
numbers[i] = numbers[j];
numbers[j] = temp;
}
}
}
int multiplyPositiveNum = numbers[numbers.length - 1] * numbers[numbers.length - 2];
int multiplyNegativeNum = numbers[0] * numbers[1];
return Math.max(multiplyPositiveNum, multiplyNegativeNum);
}
}
Java
복사
직각 삼각형 출력하기
package programmers.CodingBegginerTraining;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class PROB9 {
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder();
int n = Integer.parseInt(br.readLine());
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++) {
sb.append("*");
}
sb.append("\n");
}
System.out.println(sb);
}
}
Java
복사
문자열 정렬하기(1)
package programmers.CodingBegginerTraining;
import java.util.*;
public class PROB10 {
public static void main(String[] args) {
String my_string = "hi2392";
System.out.println(Arrays.toString(solution(my_string)));
}
public static int[] solution(String my_string) {
String numbers = my_string.replaceAll("[^0-9]", "");
int[] answer = new int[numbers.length()];
for (int i = 0; i < numbers.length(); i++) {
answer[i] = Integer.parseInt(String.valueOf(numbers.charAt(i)));
}
int temp;
for (int i = 0; i < answer.length; i++) {
for (int j = 0; j < answer.length; j++) {
if (answer[i] < answer[j]) {
temp = answer[i];
answer[i] = answer[j];
answer[j] = temp;
}
}
}
return answer;
}
}
Java
복사
n 의 배수 고르기
package programmers.CodingBegginerTraining;
import java.util.*;
public class PROB11 {
public int[] solution(int n, int[] numlist) {
List<Integer> numbers = new ArrayList<>();
for (int i = 0; i < numlist.length; i++) {
if (numlist[i] % n == 0) {
numbers.add(numlist[i]);
}
}
return numbers.stream().mapToInt(i -> i).toArray();
}
}
Java
복사