2023.12.31 - 5문제

 

 

 

공백으로 구분하기 2

https://school.programmers.co.kr/learn/courses/30/lessons/181868

프로그래머스

import java.util.*;

class Solution {
    public String[] solution(String my_string) {
        String[] answer = my_string.split(" ");
        ArrayList<String> list = new ArrayList<>();
        
        for(int i=0; i<answer.length; i++) {
            if(answer[i].equals("")) continue;
            else list.add(answer[i]);
        }
        
        String[] result = list.toArray(new String[0]);
        return result;
    }
}

 

 

0 떼기

https://school.programmers.co.kr/learn/courses/30/lessons/181847

프로그래머스

class Solution {
    public String solution(String n_str) {
        String answer = "";
        int n = 0;
        
        for(int i=0; i<n_str.length(); i++) {
            if(n_str.charAt(i) != '0') {
                n = i;
                break;
            }
        }
        
        answer = n_str.substring(n);
        return answer;
    }
}

 

 

5명씩

https://school.programmers.co.kr/learn/courses/30/lessons/181886

프로그래머스

class Solution {
    public String[] solution(String[] names) {
        int count = 0;
        int n;
        n = names.length%5 == 0 ? names.length / 5 : names.length / 5 + 1;
        
        String[] answer = new String[n];
        
        for(int i=0; i<answer.length; i++) {
            answer[i] = names[count];
            count += 5;
        }
        
        
        return answer;
    }
}

 

 

n보다 커질 때까지 더하기

https://school.programmers.co.kr/learn/courses/30/lessons/181884

프로그래머스

class Solution {
    public int solution(int[] numbers, int n) {
        int answer = 0;
        
        for(int i : numbers) {
            answer += i;
            if (answer > n) break;
        }
        
        return answer;
    }
}

 

 

 

배열 만들기 1

https://school.programmers.co.kr/learn/courses/30/lessons/181901

프로그래머스

class Solution {
    public int[] solution(int n, int k) {
        int[] answer = new int[n/k];
        int count = 1;
        
        for(int i=0; i<answer.length; i++) {
            answer[i] = k * count;
            count++;
        }
        
        return answer;
    }
}