Skip to content

leet code

1148 - plus one

  • 알고리즘
  • reverse array
  • plus one with while loop
  • reverse array
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
class Solution {
public:
    vector<int> plusOne(vector<int>& digits) {

        // reverse
        int tmp=0;
        int size=digits.size();
        for(int i=0; i<size/2; ++i)
        {
            tmp = digits[i];
            digits[i] = digits[size-1-i];
            digits[size-1-i] = tmp;
        }

        int i=0;
        int flag=0;
        digits[0]++;
        while(i<size)
        {
            digits[i] += flag;
            if(digits[i]>=10)
            {
                flag = 1;
                digits[i] = 0;
            }else
            {
                flag = 0;
            }
            i++;
        }
        if(flag)
        {
            digits[size-1] = 0;
            digits.push_back(1);
        }

        size = digits.size();
        for(int i=0; i<size/2;++i)
        {
            tmp = digits[i];
            digits[i] = digits[size-1-i];
            digits[size-1-i] = tmp;
        }

        return digits;
    }
};