MapleStory Finger Point Cute Line Smiley Blinking Hello Kitty Angel MapleStory Finger Point

๐Ÿƒ‍โ™€๏ธprogrammers/Java

หšโ‚Šโœฉโ€งโ‚Š ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค java - ์—ฐ์†๋œ ์ˆ˜์˜ ํ•ฉ หšโ‚Šโœฉโ€งโ‚Š

HYEJU01 2024. 6. 12. 14:50
์ฒด๊ฐ Level : โ˜…โ˜…โ˜†
Review: ์ˆ˜์˜ ๊ทœ์น™์„ฑ ์ฐพ๊ธฐ, ์ˆ˜์‹์œผ๋กœ ํ’€๋ฉด ์ •๋ง ๊ฐ„๋‹จํ•˜๊ฒŒ ํ’€ ์ˆ˜ ์žˆ๋Š” ๋ฌธ์ œ !

 

๐Ÿ’ก ์—ฐ์†๋œ ์„ธ ๊ฐœ์˜ ์ •์ˆ˜๋ฅผ ๋”ํ•ด 12๊ฐ€ ๋˜๋Š” ๊ฒฝ์šฐ๋Š” 3, 4, 5์ž…๋‹ˆ๋‹ค. ๋‘ ์ •์ˆ˜ num๊ณผ total์ด ์ฃผ์–ด์ง‘๋‹ˆ๋‹ค. ์—ฐ์†๋œ ์ˆ˜ num๊ฐœ๋ฅผ ๋”ํ•œ ๊ฐ’์ด total์ด ๋  ๋•Œ, ์ •์ˆ˜ ๋ฐฐ์—ด์„ ์˜ค๋ฆ„์ฐจ์ˆœ์œผ๋กœ ๋‹ด์•„ return

 

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

 

 

 

์ˆซ์ž๊ฐ€ ์ˆœ์„œ๋Œ€๋กœ ๋”ํ•ด์ ธ์•ผํ•˜๊ธฐ๋•Œ๋ฌธ์— ๋ฐ˜๋ณต๋ฌธ์˜ ์ฆ๊ฐ๊ฐ’์„ ์ž˜ ์กฐ์ ˆํ•˜๋ฉด ๋˜๊ฒ ๊ตฌ๋‚˜ ์‹ถ์—ˆ๋‹ค.!

 

๋ฐฐ์—ด์—๋Š” ์Œ์ˆ˜ ๊ฐ’๋„ ๋“ค์–ด๊ฐˆ ์ˆ˜ ์žˆ๊ธฐ ๋•Œ๋ฌธ์— 

-1000 ~ 1000 ๋ฒ”์œ„๋กœ ์žก์•„์ค€๋‹ค. 

 

count ๋Š” ์ฆ๊ฐ ์นด์šดํŠธ ์—ญํ• .

1) num ๋ฒˆ ๋ฐ˜๋ณตํ•˜๊ฒŒ๋˜๋ฉด ๋ฉˆ์ถ”๊ณ  ๋น„๊ต ์‹œ์ž‘.

2) ์—ฌํƒœ i ๊ฐ’๋“ค์„ ๋”ํ•œ sum ์ด total ๊ณผ ๊ฐ™์œผ๋ฉด 

3) i ๊ฐ’๋“ค์„ ํ•˜๋‚˜ํ•˜๋‚˜ ๋ฐฐ์—ด์— ๋„ฃ์–ด์ค€๋‹ค. (๋™์  ๋ฐฐ์—ด ์‚ฌ์šฉ)

 

4) total ๊ณผ ๊ฐ™์ง€ ์•Š์€ ๊ฒฝ์šฐ์—๋Š” ๋‹ค์‹œ ๊ฐ’๋“ค์„ ์ดˆ๊ธฐํ™”ํ•ด์ค˜์•ผํ•œ๋‹ค.

5) count ์ฆ๊ฐ’ ์นด์šดํŠธ ์ดˆ๊ธฐํ™” / sum ๋”ํ•œ ๊ฐ’ ์ดˆ๊ธฐํ™” / i ๊ฐ’์€ num -1 ๋งŒํผ ๋’ค๋กœ ๊ฐ€์„œ ๋น„๊ต

 

 

[์„ฑ๊ณต]

import java.util.*;

class Solution {
    public List<Integer> solution(int num, int total) {
        List<Integer> answer = new ArrayList<>();
        int sum = 0;
        int count = 0;
        
        
        for (int i = -1000; i <= 1000; i++){
            count ++;
            sum += i;
            
            if (count == num){
                if (sum == total){
                  for (int j = i-num+1; j <= i; j++){
                      answer.add(j);
                  }
                }else{
                    count = 0;
                    sum = 0;
                    i -= num-1;
                }
            }
        }
            
        
        return answer;
    }
}

 

 

 


[์ฐธ๊ณ ]

 

๊ทœ์น™์„ฑ์„ ์ฐพ์•„ ์ˆ˜์‹์œผ๋กœ ๋งŒ๋“ค์–ด ํ‘ผ ์ฝ”๋“œ์ด๋‹ค!

์„ค๋ช…๋„ ์ž˜ ๋˜์–ด์žˆ๋‹ค!

 

Total = now total + (num x n) 

(Total - now total) /num = n

 

 

https://fall-in-dream.tistory.com/28

 

์ฝ”๋”ฉํ…Œ์ŠคํŠธ ์—ฐ์Šต > ์—ฐ์†๋œ ์ˆ˜์˜ ํ•ฉ - JAVA

๋ฌธ์ œ ์„ค๋ช… ์—ฐ์†๋œ ์„ธ ๊ฐœ์˜ ์ •์ˆ˜๋ฅผ ๋”ํ•ด 12๊ฐ€ ๋˜๋Š” ๊ฒฝ์šฐ๋Š” 3, 4, 5์ž…๋‹ˆ๋‹ค. ๋‘ ์ •์ˆ˜ num๊ณผ total์ด ์ฃผ์–ด์ง‘๋‹ˆ๋‹ค. ์—ฐ์†๋œ ์ˆ˜ num๊ฐœ๋ฅผ ๋”ํ•œ ๊ฐ’์ด total์ด ๋  ๋•Œ, ์ •์ˆ˜ ๋ฐฐ์—ด์„ ์˜ค๋ฆ„์ฐจ์ˆœ์œผ๋กœ ๋‹ด์•„ returnํ•˜๋„๋ก solu

fall-in-dream.tistory.com

 

 


[์‹คํŒจ] ์ •์ˆ˜ ๋ฒ”์œ„๋ฅผ ์ž˜๋ชป์žก์•˜๋‹ค!

import java.util.*;

class Solution {
    public List<Integer> solution(int num, int total) {
        List<Integer> answer = new ArrayList<>();
        int sum = 0;
        
        int count = 0;
        for (int i = 1; i <= 100; i++){
            count ++;
            sum += i;
            
            if (count == num){
                if (sum == total){
                  for (int j = i-num+1; j <= i; j++){
                      answer.add(j);
                  }
                }else{
                    count = 0;
                    sum = 0;
                    i -= num-1;
                }
            }
        }
            
        
        return answer;
    }
}