qq422243639的博客

class Solution { public: int findComplement(int num) { int temp, i=1, j; temp = num; while (temp != 0){ temp /= 2; i *= 2; } j = i -

class Solution { public: string addStrings(string num1, string num2) { string res; int m = num1.size() - 1; //记录字符串num1最后一位 int n = num2.size() - 1; int

掌握了刚才的方法，这类问题都解决了。class Solution { public: string addBinary(string a, string b) { int m = a.size() - 1; int n = b.size() - 1; int carry = 0; string res; whil

class Solution { public: vector<string> readBinaryWatch(int num) { vector<string> res; for (int h = 0; h < 12; ++h) //12小时 for (int m = 0; m < 60; ++m)