zoukankan      html  css  js  c++  java
  • 19.2.12 [LeetCode 66] Plus One

    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.
     1 class Solution {
     2 public:
     3     vector<int> plusOne(vector<int>& digits) {
     4         int n = digits.size();
     5         digits[n - 1]++;
     6         int i = n - 1;
     7         while (digits[i] > 9 && i > 0) {
     8             digits[i - 1] += digits[i] / 10;
     9             digits[i] %= 10;
    10             i--;
    11         }
    12         if (i == 0 && digits[i] > 9) {
    13             digits.insert(digits.begin(), digits[i] / 10);
    14             digits[i + 1] %= 10;
    15         }
    16         return digits;
    17     }
    18 };
    View Code
  • 相关阅读:
    读写excel文件
    数据库操作
    django项目搭建
    django基础
    string
    random函数
    vue-typescript入门
    Visual Studio 2019配置vue项目
    js css+html实现简单的日历
    python接口自动化4-绕过验证码登录(cookie)
  • 原文地址:https://www.cnblogs.com/yalphait/p/10366169.html
Copyright © 2011-2022 走看看