
LeetCode
Keal、
To make each day count.
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
LeetCode Number Complement
class Solution {public: int findComplement(int num) { int temp, i=1, j; temp = num; while (temp != 0){ temp /= 2; i *= 2; } j = i -原创 2017-01-11 10:08:47 · 211 阅读 · 0 评论 -
AddString[LeetCode]
class Solution {public: string addStrings(string num1, string num2) { string res; int m = num1.size() - 1; //记录字符串num1最后一位 int n = num2.size() - 1; int原创 2017-01-16 10:02:26 · 329 阅读 · 0 评论 -
AddBinary[LeetCode]
掌握了刚才的方法,这类问题都解决了。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原创 2017-01-16 11:04:55 · 177 阅读 · 0 评论 -
BinaryWatch[LeetCode]
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)原创 2017-01-16 13:38:05 · 229 阅读 · 0 评论