로딩
요청 처리 중입니다...

JAVA_Plus One_LeetCode 66

 JAVA_Plus One_LeetCode 66

JAVA_Plus One_LeetCode 66 Plus One 풀이 class Solution { public int[] plusOne(int[] digits) { for(int i = digits.length - 1; i >= 0; i--){ if(++digits[i] != 10){ return digits; } digits[i] = 0; } int [] res = new int[digits.length + 1]; res[0] = 1; return res; } } * 출처 Level up your coding skills and quickly land a job.

This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com...

# JAVA # JAVA_LeetCode66 # JAVA_PlusOne # JAVA_PlusOne_LeetCode66 # PlusOne_LeetCode66