Algorithm Study

[Java Algorithm] ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค Lv.0 _ ๋ฌธ์ž์—ด์˜ ๋’ค์˜ n๊ธ€์ž

microsaurs 2024. 2. 28. 16:20
๐Ÿ‘ฟ ๋ฌธ์ œ ๐Ÿ‘ฟ
๋ฌธ์ž์—ด my_string๊ณผ ์ •์ˆ˜ n์ด ๋งค๊ฐœ๋ณ€์ˆ˜๋กœ ์ฃผ์–ด์งˆ ๋•Œ, my_string์˜ ๋’ค์˜ n๊ธ€์ž๋กœ ์ด๋ฃจ์–ด์ง„ ๋ฌธ์ž์—ด์„ return ํ•˜๋Š” solution ํ•จ์ˆ˜๋ฅผ ์ž‘์„ฑํ•ด์ฃผ์„ธ์š”.

 

[Algorithm]

substring ํ•จ์ˆ˜๋ฅผ ํ™œ์šฉํ•˜๊ธฐ !

* substring ํ•จ์ˆ˜๋Š” ์ธ์ž๋กœ ์ฃผ์–ด์ง€๋Š” ์ธ๋ฑ์Šค๊ฐ’์„ ๊ธฐ์ค€์œผ๋กœ ๋ฌธ์ž์—ด์„ ์ž๋ฅด๋Š” ํ•จ์ˆ˜

 

[Code]

class Solution {
    public String solution(String my_string, int n) {
        String answer = my_string.substring(my_string.length() - n);
        return answer;
    }
}

 

[+ Plus]

โญ๏ธ substring ํ•จ์ˆ˜์˜ index
: substring ํ•จ์ˆ˜์˜ ์ž…๋ ฅ ์ธ์ž๊ฐ’์€ 2๊ฐœ (startIndex, endIndex)
startIndex์—์„œ ์‹œ์ž‘, endIndex - 1 ๊นŒ์ง€์˜ ๊ฐ’์„ return ( endIndex๋ฅผ ํฌํ•จํ•˜์ง€ ์•Š์Œ! )
* index ๊ฐ’์€ 0๋ถ€ํ„ฐ ์‹œ์ž‘ (๋‹น์—ฐํ•จ)
โ€ผ๏ธ ์ธ์ž๊ฐ’์„ ํ•˜๋‚˜๋งŒ ๊ธฐ์ž…ํ•˜๋ฉด startIndex๋กœ ์ธ์‹ ํ›„, startIndex์—์„œ ๋ฌธ์ž์—ด ๋๊นŒ์ง€ return