We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
原题链接:https://leetcode-cn.com/problems/plus-one/
解题思路:
/** * @param {number[]} digits * @return {number[]} */ var plusOne = function (digits) { // 倒序遍历数组 for (let i = digits.length - 1; i >= 0; i--) { // 对当前位进行加1操作,如果结果为10,则表示需要进位,需要把当前位置为0 if (++digits[i] >= 10) { digits[i] = 0; } else { // 如果当前不需要进位,则之后的位数也不需要继续操作,直接返回结果 return digits; } } return [1, ...digits]; };
The text was updated successfully, but these errors were encountered:
No branches or pull requests
原题链接:https://leetcode-cn.com/problems/plus-one/
解题思路:
The text was updated successfully, but these errors were encountered: