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번 방법은 λ‹€λ₯Έ μ‚¬λžŒ 풀이 보고,, λŒ€κ°ˆνœ˜λ₯Ό 탉 쳐버림 !