-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathplusOne.cpp
More file actions
70 lines (52 loc) · 1.58 KB
/
plusOne.cpp
File metadata and controls
70 lines (52 loc) · 1.58 KB
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <vector>
#include <iostream>
#include <algorithm>
#include <iterator>
using namespace std;
vector<int> wrongPlusOne(vector<int> &A) {
// Do not write main() function.
// Do not read input, instead use the arguments to the function.
// Do not print the output, instead return values as specified
// Still have a doubt. Checkout www.interviewbit.com/pages/sample_codes/ for more details
int n = A.size();
int offset = 0;
if (A.size() != 1) {
while(A[offset++] == 0) {}
}
long long sum = 0;
for (int i = offset; i < n; ++i) {
sum = sum*10 + A[i];
cout<<A[i]<<" "<<sum<<endl;
}
sum += 1;
cout<<sum<<endl;
vector<int> output;
while (sum) {
output.push_back(sum % 10);
sum = sum/10;
}
std::reverse(output.begin(), output.end());
return output;
}
vector<int> plusOne(vector<int> & A) {
int n = A.size();
int offset = 0;
if (A.size() != 1) {
while(A[offset] == 0) { offset++; }
}
vector<int> output;
int carry = 1;
for (int j = n-1; j >= offset; --j){
int sum = A[j]+carry;
output.push_back(sum%10);
carry = sum/10;
}
if (carry) output.push_back(carry);
std::reverse(output.begin(), output.end());
return output;
}
int main () {
vector<int> v = { 0, 3, 7, 6, 4, 0, 5, 5, 5 };
vector<int> output = plusOne(v);
copy(output.begin(), output.end(), ostream_iterator<int>(cout," "));
}