leetcode刷题11天
66. Plus One
Easy
807
1425
Favorite
Share
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.
代码:
class Solution {
public int[] plusOne(int[] digits) {
if(digits.length<=0)
return null;
if(digits[digits.length-1]==9) {
int i = digits.length-1;
while(i>=0&&digits[i]==9) {
digits[i]=0;
i--;
}
if(i<0) {
int[] newdigits = new int[digits.length+1];
newdigits[0] =1;
return newdigits;
}
else {
digits[i]++;
return digits;
}
}
else {
digits[digits.length-1]++;
return digits;
}
}
}
- Add Binary
Given two binary strings, return their sum (also a binary string).
The input strings are both non-empty and contains only characters 1 or 0.
Example 1:
Input: a = “11”, b = “1”
Output: “100”
Example 2:
Input: a = “1010”, b = “1011”
Output: “10101”
代码:
class Solution {
public String addBinary(String a, String b) {
if(a.isEmpty()||b.isEmpty())
return "";
int ia = a.length()-1;
int ib = b.length() -1;
int flag = 0;
String res = "";
int num1,num2;
while(ia>=0||ib>=0) {
int tempres = 0;
if(ia>=0)
{
num1 = a.charAt(ia) - '0';
tempres = tempres+num1;
ia--;
}
if(ib>=0)
{
num2 = b.charAt(ib) - '0';
tempres = tempres+num2;
ib--;
}
tempres = tempres + flag;
flag = tempres>=2?1:0;
res = (tempres%2==0?'0':'1') + res ;
}
if(flag==1) {
res = '1'+res;
}
return res;
}
}