zoukankan      html  css  js  c++  java
  • Leetcode:66. Plus One

    Description

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

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

    The digits are stored such that the most significant digit is at the head of the list.

    思路

    • 没啥好说的,注意进位问题。

    代码

    class Solution {
    public:
        vector<int> plusOne(vector<int>& digits) {
            int len = digits.size();
            vector<int> res;
            if(len == 0) return res;
            
            int count = 0;
            for(int i = len - 1; i >= 0; --i){
                if(i == len - 1){
                    count = (digits[i] + 1) / 10;
                    res.push_back((digits[i] + 1) % 10);
                }
                else{
                    res.push_back((digits[i] + count) % 10);
                    count = (digits[i] + count) / 10;
                }
            }
            
            if(count > 0) 
                res.push_back(count);
            
            for(int i = 0, j = res.size() - 1; i < j; ++i, --j)
                swap(res[i], res[j]);
            
            return res;
        }
    };
    
  • 相关阅读:
    网页字体设置你了解吗?
    CSS 定位 (Positioning)
    常用CSS缩写语法总结
    CSS 教程
    CSS Reset(CSS重置)
    边框模拟小三角形
    CSS sprites
    border:none和border:0的区别
    css display属性
    css的postion属性
  • 原文地址:https://www.cnblogs.com/lengender-12/p/6919900.html
Copyright © 2011-2022 走看看