LeetCode Plus One

 1 class Solution {
 2 public:
 3     vector<int> plusOne(vector<int> &digits) {
 4         // Start typing your C/C++ solution below
 5         // DO NOT write int main() function
 6         int  c=0;
 7         int i=digits.size()-1;
 8         vector<int> v;
 9         int t=digits[i];
10         digits[i]=(t+1)%10;
11         c=(t+1)/10;
12         
13         for(i--;i>=0;i--)
14         {
15             t=digits[i];
16             digits[i]=(c+t)%10;
17             c=(t+c)/10;        
18         }
19         if(c)
20             v.push_back(c);
21         for(i=0;i<digits.size();i++)
22             v.push_back(digits[i]);
23         
24         return v;
25     }
26 };
27 
28 
29 
30 class Solution {
31 public:
32     vector<int> plusOne(vector<int> &digits) {
33         // Start typing your C/C++ solution below
34         // DO NOT write int main() function
35         int  c=1;   
36         int i;
37         for(i=digits.size()-1;i>=0;i--)
38         {
39             int t=digits[i];
40             digits[i]=(c+t)%10;
41             c=(t+c)/10;        
42         }
43         if(c)
44             digits.insert(digits.begin(),c);
45         return digits;
46     }
47 };
48 
49 
50 class Solution {
51 public:
52     vector<int> plusOne(vector<int> &digits) {
53         // Start typing your C/C++ solution below
54         // DO NOT write int main() function
55         vector<int> v(digits);
56         int  c=1;   
57         int i;
58         
59         for(i=v.size()-1;i>=0;i--)
60         {
61             int t=v[i];
62             v[i]=(c+t)%10;
63             c=(t+c)/10;        
64         }
65         if(c)
66             v.insert(v.begin(),c);
67         return v;
68     }
69 };