Leetcode/July-LeetCoding-Challenge/06-Plus-One/Plus-One.cs at master · AlgoStudyGroup/Leetcode · GitHub

Name: Leetcode/July-LeetCoding-Challenge/06-Plus-One/Plus-One.cs at master · AlgoStudyGroup/Leetcode · GitHub
Rating: 4.6 (9625 reviews)
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
publicclassSolution
{
//Shorter solution
publicint[]PlusOne(int[]digits)
{
for(inti=digits.Length-1;i>=0;i--)
{
if(digits[i]<9)
{
digits[i]++;
returndigits;
}
digits[i]=0;
}
varn=newint[digits.Length+1];
n[0]=1;
returnn;
}

//Stack solution
publicint[]PlusOne(int[]digits)
{
varstack=newStack<int>();
varcarry=0;
if(digits[digits.Length-1]==9)
{
carry=1;
}
else
{
digits[digits.Length-1]++;
}

for(inti=digits.Length-1;i>=0;i--)
{
varv=digits[i];
if(carry==1)
{
v+=1;
}
if(v==10)
{
digits[i]=0;
carry=1;
}
else
{
digits[i]=v;
carry=0;
}
stack.Push(digits[i]);
}
if(carry==1)
{
stack.Push(1);
}
returnstack.ToArray();
}
}