Leetcode - 随笔分类(第2页) - JTechRoad

419. Battleships in a Board

摘要：class Solution { public: int countBattleships(vector>& board) { int res = 0; for (int i = 0; i 0 && board[i-1][j] == 'X' || j > 0 && board[i][j-1] == 'X') ... 阅读全文

posted @ 2018-11-27 17:03 JTechRoad 阅读(81) 评论(0) 推荐(0)

779. K-th Symbol in Grammar

摘要：class Solution { public: int kthGrammar(int N, int K) { return helper(N, K, false); } int helper(int n, int k, bool reverse) { if (n == 1) return reverse; int tota... 阅读全文

posted @ 2018-11-27 05:42 JTechRoad 阅读(103) 评论(0) 推荐(0)

783. Minimum Distance Between BST Nodes

摘要：/** * 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-27 05:33 JTechRoad 阅读(97) 评论(0) 推荐(0)

412. Fizz Buzz

摘要：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)

226. Invert Binary Tree

摘要：/** * 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 阅读(57) 评论(0) 推荐(0)

169. Majority Element

摘要：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)

83. Remove Duplicates from Sorted List

摘要：/** * 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)

85. Maximal Rectangle

摘要：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)

278. First Bad Version

摘要：// 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)

486. Predict the Winner

摘要：class Solution { public: bool PredictTheWinner(vector& nums) { return helper(nums, 0, nums.size()-1, true, 0, 0); } // return true if player1 can win. false if player1 will lose. ... 阅读全文

posted @ 2018-11-23 16:35 JTechRoad 阅读(124) 评论(0) 推荐(0)

126. Word Ladder II

摘要：class Solution { public: vector> findLadders(string beginWord, string endWord, vector& wordList) { unordered_set s(wordList.begin(), wordList.end()); vector> res; if (s.fi... 阅读全文

posted @ 2018-11-23 15:07 JTechRoad 阅读(173) 评论(0) 推荐(0)

127. Word Ladder

摘要：class Solution { public: int ladderLength(string beginWord, string endWord, vector& wordList) { unordered_set s(wordList.begin(), wordList.end()); if (s.find(endWord) == s.end() |... 阅读全文

posted @ 2018-11-22 08:21 JTechRoad 阅读(115) 评论(0) 推荐(0)

213. House Robber II

摘要：class Solution { public: int rob(vector& nums) { if (nums.size() == 0) return 0; if (nums.size() == 1) return nums[0]; return max(helper(nums, 0, nums.size()-2), helpe... 阅读全文

posted @ 2018-11-22 07:40 JTechRoad 阅读(93) 评论(0) 推荐(0)

84. Largest Rectangle in Histogram

摘要：class Solution { public: int largestRectangleArea(vector& h) { stack s; int res = 0; h.push_back(0); for (int i = 0; i < h.size(); i++) { while (!s.emp... 阅读全文

posted @ 2018-11-22 06:40 JTechRoad 阅读(86) 评论(0) 推荐(0)

881. Boats to Save People

摘要：class Solution { public: int numRescueBoats(vector& people, int limit) { sort(people.begin(), people.end()); int res = 0; for (int i = 0, j = people.size()-1; i <= j; ) { ... 阅读全文

posted @ 2018-11-22 06:12 JTechRoad 阅读(99) 评论(0) 推荐(0)

148. Sort List

摘要：/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode* s... 阅读全文

posted @ 2018-11-22 02:29 JTechRoad 阅读(127) 评论(0) 推荐(0)

830. Positions of Large Groups

摘要：class Solution { public: vector> largeGroupPositions(string s) { vector> res; int start = 0, end = 0; for (int i = 1; i = 3) { vector t; ... 阅读全文

posted @ 2018-11-21 15:28 JTechRoad 阅读(89) 评论(0) 推荐(0)

279. Perfect Squares

摘要：class Solution { public: int numSquares(int n) { vector c; for (int i = 1; i*i q; q.push(0); int lv = 0; while (!q.empty()) { int qs = q.size(... 阅读全文

posted @ 2018-11-21 15:09 JTechRoad 阅读(80) 评论(0) 推荐(0)

15. 3Sum

摘要：class Solution { public: vector> threeSum(vector& nums) { sort(nums.begin(), nums.end()); vector> res; if (nums.size() 0 && nums[i] == nums[i-1]) continue; i... 阅读全文

posted @ 2018-11-21 14:06 JTechRoad 阅读(100) 评论(0) 推荐(0)

430. Flatten a Multilevel Doubly Linked List

摘要：/* // Definition for a Node. class Node { public: int val = NULL; Node* prev = NULL; Node* next = NULL; Node* child = NULL; Node() {} Node(int _val, Node* _prev, Node* _next... 阅读全文

posted @ 2018-11-20 14:54 JTechRoad 阅读(88) 评论(0) 推荐(0)

随笔分类 - Leetcode

公告