Algorithm Study

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

microsaurs 2024. 2. 22. 10:43
๐Ÿ‘ฟ ๋ฌธ์ œ ๐Ÿ‘ฟ
์ •์ˆ˜ n์ด ์ฃผ์–ด์งˆ ๋•Œ, n์„ ๋ฌธ์ž์—ด๋กœ ๋ณ€ํ™˜ํ•˜์—ฌ return ํ•˜๋„๋ก solution ํ•จ์ˆ˜๋ฅผ ์™„์„ฑํ•ด์ฃผ์„ธ์š”.

 

[Algorithm]

ํ˜•๋ณ€ํ™˜์„ ํ•˜๋Š” ๋‹ค์–‘ํ•œ ๋ฐฉ๋ฒ•์„ ์ƒ๊ฐํ•ด๋ณด์ž

1. Integer.toString() ํ•จ์ˆ˜ ์‚ฌ์šฉ

2. valueOf() ์‚ฌ์šฉ

3. "" + ๋ณ€์ˆ˜ ์‚ฌ์šฉ โญ๏ธ

 

[Code]

// 1. Integer.toStirng() 
class Solultion {
	public String solution(int n) {
    	return Integer.toString(n);
    }
}

// 2. (casting ํ•˜๋ ค๋Š” ์ž๋ฃŒํ˜•).valueOf(value)
class Solution {
	public String solution(int n) {
    	return String.valueOf(n);
    }
}

// 3. "" + (value)
class Solution {
	public String solution(int n) {
    	return "" + n;
    }
}

 

[+ Plus]

โญ๏ธ String + (value) ๊ฒฐํ•ฉ(Combination)
: String ์ž๋ฃŒํ˜•์€ +์™€ ํ•จ๊ป˜ ๋‹ค๋ฅธ ์ž๋ฃŒํ˜•๊ณผ ํ•ฉ์ณ์ง€๋ฉด ๋‹ค๋ฅธ ์ž๋ฃŒํ˜•์„ String์œผ๋กœ ๋ณ€ํ™˜์‹œํ‚ด !
โžก๏ธ "" + n ์„ ํ•˜๋ฉด n์ด ๋ฌธ์ž์—ด๋กœ ํ˜•๋ณ€ํ™˜์ด ๋จ

 

3๋ฒˆ ๋ฐฉ๋ฒ•์€ ๋‹ค๋ฅธ ์‚ฌ๋žŒ ํ’€์ด ๋ณด๊ณ ,, ๋Œ€๊ฐˆํœ˜๋ฅผ ํƒ‰ ์ณ๋ฒ„๋ฆผ !