๊ด€๋ฆฌ ๋ฉ”๋‰ด

๐Ÿฆ• ๊ณต๋ฃก์ด ๋˜์ž!

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] Java ๊ธฐ๋Šฅ๊ฐœ๋ฐœ ๋ณธ๋ฌธ

Development/CodingTest

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] Java ๊ธฐ๋Šฅ๊ฐœ๋ฐœ

Kirok Kim 2021. 12. 13. 21:51
import java.util.ArrayList;
class Solution {
    public int[] solution(int[] progresses, int[] speeds) {
        ArrayList<Integer> aanswer = new ArrayList<>();
        ArrayList<Integer> ll = new ArrayList<>();
        int cnt=0;
        for(int i=0; i<progresses.length;i++){
            int l=progresses[i];
            while(l<100){
                l+=speeds[i];
                cnt++;
            }
                ll.add(cnt);
                cnt=0;
        }

		cnt = 1;
		int j = 0;
		while (true) {
			if (ll.get(j) >= ll.get(j + 1)) {
				ll.remove(j + 1);
				cnt++;
			} else {
				j++;
				aanswer.add(cnt);
				cnt = 1;
			}

			if (ll.size() - 1 == j) {
				aanswer.add(cnt);
				break;
			}
		}

		int[] answer = new int[aanswer.size()];
		for (int i = 0; i < aanswer.size(); i++) {
			answer[i] = aanswer.get(i);
		}
		return answer;
	}
}
  • ์ตœ์ดˆ์—๋Š” ๊ธฐ์กด ๊ทธ๋Œ€๋กœ ๋ฐฐ์—ด์—๋‹ค๊ฐ€ ๋‹ด์œผ๋ ค ํ–ˆ์ง€๋งŒ index๋ฒ”์œ„ ์ดˆ๊ณผ๋กœ ๊ณจ๋จธ๋ฆฌ๋ฅผ ์•“๋‹ค๊ฐ€ ๊ฐ„๋‹จํžˆ arraylist๋กœ ์ „ํ–ฅํ•˜์—ฌ ์ผ๋‹ค.
  • ์—…๋ฌด์˜ ์ง„ํ–‰์€ ๋™์‹œ์— ์ง„ํ–‰๋˜๋ฉฐ 100์ด ๋„˜์ง€ ์•Š๋Š” ๋™์•ˆ ๊ณ„์† ๋”ํ•ด์ฃผ๋ฉฐ list์— cnt๋ฅผ ์„ธ์–ด ๋„ฃ์—ˆ๋‹ค.
  • ๋‹ค๋งŒ ์ข€ ์•„์‰ฌ์šด ๋ถ€๋ถ„์ด ์žˆ๋‹ค๋ฉด ์ œ์ผ ๋งˆ์ง€๋ง‰ ๋ถ€๋ถ„ ArrayList๋ฅผ Array๋กœ ๋ฐ”๊ฟ” ์ฃผ๋Š” ๋ถ€๋ถ„์„ ๋ฐ˜๋ณต๋ฌธ์„ ํ†ตํ•ด ๋ณ€ํ™˜ ํ•˜๋Š” ๊ฒƒ ๋ง๊ณ  ๋ฉ”์†Œ๋“œ๋ฅผ ํ†ตํ•ด์„œ ๋ณ€ํ™˜ํ•˜๋Š” ๊ฒƒ์„ ์—ผ๋‘ํ•ด ๋ณด์ž
๋ฐ˜์‘ํ˜•
Comments