// https://leetcode.com/problems/plus-one/submissions/
public class Solution {
public int[] PlusOne(int[] digits)
{
int[] toadd = new int[digits.Length];
toadd[toadd.Length - 1] = 1;
var numbers = new Stack<int>();
int inMemory = 0;
for (int i = digits.Length - 1; i >=0; i--)
{
int number = digits[i] + toadd[i] + inMemory;
if (number > 9)
{
string numberStr = number.ToString();
inMemory = numberStr[0] - '0';
numbers.Push(numberStr[1] - '0');
}
else
{
inMemory = 0;
numbers.Push(number);
}
}
if (inMemory > 0)
numbers.Push(inMemory);
int[] res = new int[numbers.Count];
int j = 0;
while (numbers.Count > 0)
{
var number = numbers.Pop();
res[j] = number;
j++;
}
return res;
}
}
-
MY PROJECTS
-
Recent Posts
- SQL. NULL and logical operators
- Java. Simple Gradle Application
- Leetcode.Solved.Missing-number
- Leetcode.Solved.Intersection-of-two-arrays
- DesignPatterns.AbstractFactory
- DesignPatterns.Factory
- Leetcode.Solved.ContainsDublicate
- Leetcode.Solved.Majority-element
- Leetcode.Solved.MergeSortedArray
- Leetcode.Solved.PlusOne
- Leetcode.Solved.SingleNumber
- Leetcode.Solved.Number-of-good-pairs
- Leetcode.Solved.Two-sum
- Leetcode.Solved.Repeated-substring-pattern
- Leetcode.Solved.Concatenation-of-array
- Leetcode.Solved. Search-insert-position
- WepPackDevServer
- Git. Rev-Parse. Getting latest commit
- Git.Log
- Git.Revert
Categories
- Aptana
- Azure
- C#
- DataSnap
- DBExpress
- Delphi
- Delphi и сети
- Delphi. Язык программирования
- ExtJS
- FastReport
- FireDAC
- FireMonkey
- GIT
- ICS
- IDE
- IIS
- Indy
- InnoSetup
- javascript
- jQuery
- JSON
- LiveBindings
- MSHTML
- MySQL
- PHP
- REST
- Ribbons
- SMS
- SQL инструкции
- SVN
- TRichView
- UniGui
- WebBroker
- WinAPI
- Windows
- Алгоритмы
- Без рубрики
- Деревья
- Ищу ответ
- Компонентостроение
- Мои компоненты
- Начальный уровень
- Обработка исключений
- Парсинг
- Потоки(Threads)
- Регулярные выражения
- Тестирование приложений