# LeetCode 66 Plus One (Python)

## Description

https://leetcode.com/problems/count-and-say/

Given a non-empty array of digits representing a non-negative integer, plus one to the integer.

The digits are stored such that the most significant digit is at the head of the list, and each element in the array contain a single digit.

You may assume the integer does not contain any leading zero, except the number 0 itself.

Example 1:

``````Input: [1,2,3]
Output: [1,2,4]
``````

Explanation: The array represents the integer 123.

Example 2:

``````Input: [4,3,2,1]
Output: [4,3,2,2]
``````

Explanation: The array represents the integer 4321.

## Solution 1:

In python, there are some functions to shorten the code.

• divmod()

Change:

to:

divmod(): takes two numbers and returns a pair of numbers consisting of their quotient and remainder, (x / y , x % y)

• join list

to：

## Solution 2:

Exchange blogroll： http://laker.me/blog
Github：https://github.com/younglaker

LeetCode 66 Plus One (Python) 