본문 바로가기

java257

[Programmers] Lv.0 / PCCE / 6번 / 가채점 / Java 문제 풀이class Solution { public String[] solution(int[] numbers, int[] our_score, int[] score_list) { int num_student = numbers.length; String[] answer = new String[num_student]; for (int i = 0; i  출처https://school.programmers.co.kr/learn/courses/30/lessons/250128 2024. 6. 18.
[Programmers] Lv.0 / PCCE / 5번 / 산책 / Java 문제 풀이class Solution { public int[] solution(String route) { int east = 0; int north = 0; int[] answer = new int [2]; for(int i=0; i 출처https://school.programmers.co.kr/learn/courses/30/lessons/250129 2024. 6. 18.
[Programmers] Lv.0 / PCCE / 4번 / 저축 / Java 문제 풀이import java.util.Scanner;public class Solution { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int start = sc.nextInt(); int before = sc.nextInt(); int after = sc.nextInt(); int money = start; int month = 1; while (money  출처https://school.programmers.co.kr/learn/courses/30/lessons/250130 2024. 6. 18.
[Programmers] Lv.0 / PCCE / 3번 / 나이 계산 / Java 문제 풀이import java.util.Scanner;public class Solution { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int year = sc.nextInt(); String age_type = sc.next(); int answer = 0; if (age_type.equals("Korea")) { answer = 2030 - year + 1; } else if (age_type.equals("Year")) { answer = 2030 - y.. 2024. 6. 18.
[Programmers] Lv.0 / PCCE / 2번 / 피타고라스의 정리 / Java 문제 풀이import java.util.Scanner;public class Solution { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); int c = sc.nextInt(); int b_square = (c * c) - (a * a); System.out.println(b_square); }} 출처https://school.programmers.co.kr/learn/courses/30/lessons/250132 2024. 6. 18.
[Programmers] Lv.0 / PCCE / 1번 / 출력 / Java 문제 풀이import java.util.Scanner;public class Solution { public static void main(String[] args) { String msg = "Spring is beginning"; int val1 = 3; String val2 = "3"; System.out.println(msg); System.out.println(val1 + 10); System.out.println(val2 + "10"); }} 출처https://school.programmers.co.kr/learn/courses/30/lessons/250133 2024. 6. 18.
[Programmers] Lv.0 / 가장 큰 수 찾기 / Java 문제 풀이import java.util.Arrays;class Solution { public int[] solution(int[] array) { int max = Integer.MIN_VALUE; int maxIndex = -1; for(int i = 0; i max) { max = array[i]; maxIndex = i; } } return new int[]{max, maxIndex}; }} IntStream 써보려 했는데Java 의 lambda 식 내부에서 지역 변수를 참조할 때, 그 변수는 final 또는 effectively fin.. 2024. 6. 17.
[Programmers] Lv.0 / 문자열 계산하기 / Java 문제 풀이class Solution { public int solution(String my_string) { String[] formula = my_string.split(" "); int num1 = Integer.parseInt(formula[0]); int num2 = Integer.parseInt(formula[2]); int answer = num1; for(int i = 1; i import java.util.Arrays;class Solution { public int solution(String my_string) { // 1st replcaeAll(): 음수로 치환 .. 2024. 6. 15.
[Programmers] Lv.0 / 배열의 유사도 / Java 문제 풀이import java.util.Arrays;class Solution { public int solution(String[] s1, String[] s2) { long count = Arrays.stream(s1) .filter(str -> Arrays.stream(s2).anyMatch(str::equals)) .count(); return (int) count; }}import java.util.*;class Solution { public int solution(String[] s1, String[] s2) { // 중복된 원소를 가지고 있다는 조건이 없을 때 Set set = new Has.. 2024. 6. 15.
[Programmers] Lv.0 / 숫자 찾기 / Java 문제 풀이import java.util.Arrays;class Solution { public int solution(int num, int k) { int index = Integer.toString(num).indexOf(Integer.toString(k)); return (index == -1) ? index : index + 1; }}import java.util.Arrays;class Solution { public int solution(int num, int k) { int index = String.valueOf(num).indexOf(String.valueOf(k)); return (index == -1) ? index :.. 2024. 6. 15.
[Programmers] Lv.0 / 문자열안에 문자열 / Java 문제 풀이class Solution { public int solution(String str1, String str2) { return str1.contains(str2) ? 1 : 2; }} 출처https://school.programmers.co.kr/learn/courses/30/lessons/120908 2024. 5. 2.
[Programmers] Lv.0 / 제곱수 판별하기 / Java 문제 풀이 class Solution { public int solution(int n) { return isPerfectSquare(n) ? 1 : 2; } private boolean isPerfectSquare(int num) { int sqrt = (int) Math.sqrt(num); return sqrt * sqrt == num; } } class Solution { public int solution(int n) { return (n % Math.sqrt(n) == 0) ? 1 : 2; } } 출처 https://school.programmers.co.kr/learn/courses/30/lessons/120909 2024. 4. 24.