Leetcode题解（22）

66. Plus One

题目

这题很简单，直接代码：

class Solution {
public:
    vector<int> plusOne(vector<int> &digits) {
        // IMPORTANT: Please reset any member data you declared, as
        // the same Solution instance will be reused for each test case.
        int a = 1;
        vector<int> ans;
        vector<int>::iterator it;
        for(int i = digits.size() - 1;i >= 0;i--)
        {
            it = ans.begin();
            int b = (a + digits[i]) % 10;
            a = (a + digits[i]) / 10;
            ans.insert(it, b);
        }
        if(a != 0)
        {
            it = ans.begin();
            ans.insert(it, a);
        }
        
        return ans;
    }
};

------------------------------------------------------------------------------------分割线--------------------------------------------------------------

67. Add Binary

题目

直接代码

class Solution {
  public:
      string addBinary(string a, string b) {
          int lenA,lenB;
          lenA = a.length();
          lenB = b.length();
          string res="";
          

          if (0 == lenA)
          {
              return b;
          }
          if (0 == lenB)
          {
              return a;
          }
          int ia=lenA-1,ib=lenB-1;
          int count=0,temp;//进位
          char c;
          while (ia>=0&&ib>=0)
          {
              temp = a[ia]-'0'+b[ib]-'0'+count;
              count = temp/2;
              c = temp%2+'0';
              res = c+res;
              ia--;
              ib--;
          }

          while (ia>=0)
          {
              temp = a[ia]-'0'+count;
              count = temp/2;
              c = temp%2+'0';
              res = c+res;
              ia--;
          }

          while (ib>=0)
          {
              temp = b[ib]-'0'+count;
              count = temp/2;
              c = temp%2+'0';
              res = c+res;
              ib--;
          }
          if(count != 0)
          {
              c=count+'0';
              res = c+res;
          }
          return res;

      }
  };