摘要: class Solution { public: vector fizzBuzz(int n) { vector res; for (int i = 1; i <= n; i++) { if (i % 3 == 0 && i % 5 == 0) res.push_back("FizzBuzz"); ... 阅读全文
posted @ 2018-11-24 16:53 JTechRoad 阅读(112) 评论(0) 推荐(0)
摘要: /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ cla... 阅读全文
posted @ 2018-11-24 16:40 JTechRoad 阅读(58) 评论(0) 推荐(0)
摘要: class Solution { public: int majorityElement(vector& nums) { int m = 0, c = 0; for (auto i : nums) { if (c == 0) { m = i; c++; ... 阅读全文
posted @ 2018-11-24 16:36 JTechRoad 阅读(81) 评论(0) 推荐(0)
摘要: /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode* d... 阅读全文
posted @ 2018-11-24 15:44 JTechRoad 阅读(59) 评论(0) 推荐(0)
摘要: class Solution { public: int maximalRectangle(vector>& matrix) { int m = matrix.size(); if (m == 0) return 0; int n = matrix[0].size(); if (n == 0) return 0; vector> v(m,... 阅读全文
posted @ 2018-11-24 15:27 JTechRoad 阅读(91) 评论(0) 推荐(0)
摘要: // Forward declaration of isBadVersion API. bool isBadVersion(int version); class Solution { public: int firstBadVersion(int n) { int i = 1, j = n; while (i< j - 1) { ... 阅读全文
posted @ 2018-11-24 13:57 JTechRoad 阅读(87) 评论(0) 推荐(0)