随笔分类 -  LeetCode

1 2 下一页
leetcode里面的一些解决方案
leetcode 34 Search for a Range
摘要：class Solution { public: vector<int> searchRange(vector<int>& nums, int target) { int idx = search(nums, 0, nums.size() - 1, target); if (idx == -1) r 阅读全文
posted @ 2017-02-15 23:00 王坤1993 阅读(147) 评论(0) 推荐(0)
leetcode 33 Search in Rotated Sorted Array
摘要：public class Solution { public int search(int[] A, int target) { int l = 0; int r = A.length - 1; while (l <= r) { int mid = (l + r) / 2; if (target = 阅读全文
posted @ 2017-02-15 00:01 王坤1993 阅读(144) 评论(0) 推荐(0)
leetcode 32 Longest Valid Parentheses
摘要：class Solution { public: int longestValidParentheses(string s) { int res = 0, start = 0; stack<int> m; for (int i = 0; i < s.size(); ++i) { if (s[i] = 阅读全文
posted @ 2017-02-13 23:36 王坤1993 阅读(126) 评论(0) 推荐(0)
leetcode 31 Next Permutation
摘要：class Solution { public: void nextPermutation(vector<int> &num) { int i, j, n = num.size(); for (i = n - 2; i >= 0; --i) { if (num[i + 1] > num[i]) { 阅读全文
posted @ 2017-02-13 00:00 王坤1993 阅读(137) 评论(0) 推荐(0)
leetcode 30 Substring with Concatenation of All Words
摘要：class Solution { public: vector<int> findSubstring(string s, vector<string>& words) { if (s.empty() || words.empty()) return {}; vector<int> res; int 阅读全文
posted @ 2017-02-12 00:02 王坤1993 阅读(199) 评论(0) 推荐(0)
leetcode 29 Divide Two Integers
摘要：class Solution { public: int divide(int dividend, int divisor) { long long res = 0; long long m = abs((long long)dividend), n = abs((long long)divisor 阅读全文
posted @ 2017-02-12 00:01 王坤1993 阅读(149) 评论(0) 推荐(0)
leetcode 28 Implement strStr()
摘要：class Solution { public: int strStr(string haystack, string needle) { if (needle.empty()) return 0; int m = haystack.size(), n = needle.size(); if (m 阅读全文
posted @ 2017-02-12 00:00 王坤1993 阅读(202) 评论(0) 推荐(0)
leetcode 27 Remove Element
摘要：class Solution { public: int removeElement(vector<int>& nums, int val) { int res = 0; for (int i = 0; i < nums.size(); ++i) { if (nums[i] != val) nums 阅读全文
posted @ 2017-02-11 23:59 王坤1993 阅读(128) 评论(0) 推荐(0)
leetcode 26 Remove Duplicates from Sorted Array
摘要：class Solution { public: int removeDuplicates(int A[], int n) { if (n <= 1) return n; int pre = 0, cur = 0; while (cur < n) { if (A[cur] == A[pre]) ++ 阅读全文
posted @ 2017-02-11 23:57 王坤1993 阅读(97) 评论(0) 推荐(0)
leetcode 25 Reverse Nodes in k-Group
摘要：class Solution { public: ListNode* reverseKGroup(ListNode* head, int k) { ListNode *cur = head; for (int i = 0; i < k; ++i) { if (!cur) return head; c 阅读全文
posted @ 2017-02-10 22:42 王坤1993 阅读(108) 评论(0) 推荐(0)
leetcode 24 Swap Nodes in Pairs
摘要：class Solution { public: ListNode* swapPairs(ListNode* head) { if (!head || !head->next) return head; ListNode *t = head->next; head->next = swapPairs 阅读全文
posted @ 2017-02-10 22:38 王坤1993 阅读(136) 评论(0) 推荐(0)
leetcode 23 Merge k Sorted Lists
摘要：struct cmp { bool operator () (ListNode *a, ListNode *b) { return a->val > b->val; } }; class Solution { public: ListNode *mergeKLists(vector<ListNode 阅读全文
posted @ 2017-02-10 22:35 王坤1993 阅读(133) 评论(0) 推荐(0)
leetcode 22 Generate Parentheses
摘要：class Solution { public: vector<string> generateParenthesis(int n) { set<string> t; if (n == 0) t.insert(""); else { vector<string> pre = generatePare 阅读全文
posted @ 2017-02-10 22:32 王坤1993 阅读(145) 评论(0) 推荐(0)
leetcode 21 Merge Two Sorted Lists
摘要：class Solution { public: ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) { if (!l1) return l2; if (!l2) return l1; if (l1->val < l2->val) { l1->ne 阅读全文
posted @ 2017-02-10 22:29 王坤1993 阅读(111) 评论(0) 推荐(0)
leetcode 20 Valid Parentheses
摘要：class Solution { public: bool isValid(string s) { stack<char> parentheses; for (int i = 0; i < s.size(); ++i) { if (s[i] == '(' || s[i] == '[' || s[i] 阅读全文
posted @ 2017-02-10 22:27 王坤1993 阅读(133) 评论(0) 推荐(0)
leetcode 19 Remove Nth Node From End of List
摘要：class Solution { public: ListNode* removeNthFromEnd(ListNode* head, int n) { if (!head->next) return NULL; ListNode *pre = head, *cur = head; for (int 阅读全文
posted @ 2017-02-10 22:25 王坤1993 阅读(102) 评论(0) 推荐(0)
leetcode 18 4Sum
摘要：class Solution { public: vector<vector<int> > fourSum(vector<int> &nums, int target) { set<vector<int> > res; sort(nums.begin(), nums.end()); for (int 阅读全文
posted @ 2017-02-10 00:01 王坤1993 阅读(144) 评论(0) 推荐(0)
leetcode 17 Letter Combinations of a Phone Number
摘要：class Solution { public: vector<string> letterCombinations(string digits) { vector<string> res; if (digits.empty()) return res; string dict[] = {"abc" 阅读全文
posted @ 2017-02-08 22:27 王坤1993 阅读(139) 评论(0) 推荐(0)
leetcode 11 Container With Most Water
摘要： 阅读全文
posted @ 2017-02-08 00:07 王坤1993 阅读(145) 评论(0) 推荐(0)
leetcode 16 3Sum Closest
摘要：class Solution { public: int threeSumClosest(vector<int>& nums, int target) { int closest = nums[0] + nums[1] + nums[2]; int diff = abs(closest - targ 阅读全文
posted @ 2017-02-08 00:03 王坤1993 阅读(103) 评论(0) 推荐(0)

1 2 下一页