leetcode-66.加一 题意 给定一个由整数组成的非空数组所表示的非负整数,在该数的基础上加一. 最高位数字存放在数组的首位, 数组中每个元素只存储一个数字. 你可以假设除了整数 0 之外,这个整数不会以零开头. 示例 1: 输入: [1,2,3] 输出: [1,2,4] 解释: 输入数组表示数字 123. 示例 2: 输入: [4,3,2,1] 输出: [4,3,2,2] 解释: 输入数组表示数字 4321. 示例 3: 输入: [9,9,9,9] 输出: [1,0,0,0,0] 解释:…

package plusOne66; /* Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is at the head of the list. */ public class Solution { public static int[] plusOne…

题目: Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is at the head of the list.一个整数按位存在一个数组中array[0]为最高位 代码: class Solution { public: vector<int> plusO…

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 assum…

/** * @param {number[]} digits * @return {number[]} */ var plusOne = function(digits) { if(digits[digits.length - 1] != 9) { digits[digits.length - 1] += 1; } else { if(digits.length == 1) { digits.unshift(0); } digits[digits.length - 1] = 0; digits.…

给定一个由整数组成的非空数组所表示的非负整数,在该数的基础上加一. 最高位数字存放在数组的首位, 数组中每个元素只存储一个数字. 你可以假设除了整数 0 之外,这个整数不会以零开头. 示例 1: 输入: [1,2,3] 输出: [1,2,4] 解释: 输入数组表示数字 123. 示例 2: 输入: [4,3,2,1] 输出: [4,3,2,2] 解释: 输入数组表示数字 4321. 我的错误解法:不能转为数字然后操作,算法正确但是会越界然后得不到正确结果 public static int[]…

public class Solution { public int[] PlusOne(int[] digits) { ]; < ) { digits[digits.Length - ]++; return digits; } else { var list = new List<int>(); ; ; i >= ; i--) { var cur = digits[i]; cur = cur + step; ) { step = ; } else { step = ; } lis…

今天纠结了一整天============================================================== leetcode66 https://leetcode.com/problems/plus-one/?tab=Description leetcode119 https://leetcode.com/problems/pascals-triangle-ii/?tab=Description leetcode121 https://leetcode.com/…