반응형
https://leetcode.com/problems/plus-one
Plus One - LeetCode
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
vector<int> plusOne(vector<int>& digits) {
vector<int> answer;
for(int i = digits.size()-1; i >= 0; i--){
if(digits[i] < 9){
digits[i] = digits[i] + 1;
break;
}
else{
if(i == 0){
digits[i]=1;
digits.push_back(0);
}
else{
digits[i]=0;
}
}
}
answer = digits;
return answer;
}
반응형
'알고리즘_개념 및 문제풀이 ' 카테고리의 다른 글
리트코드(Leetcode)/Word_Ladder (0) | 2019.11.02 |
---|---|
리트코드/leetcode/maxsubarray/부분최대합수열 (0) | 2019.10.05 |
리트코드/Leetcode/부분수열의 최댓값 (0) | 2019.10.05 |
리트코드/leetcode/배열 중복 제거/remove-duplicates-from-sorted-array (0) | 2019.10.05 |
https://leetcode.com/problems/4sum/ (0) | 2019.09.28 |