Cpp
文章平均质量分 61
bachelorchen
这个作者很懒,什么都没留下…
展开
-
leetcode 日经贴,Cpp code -Interleaving String
Interleaving Stringclass Solution {public: bool isInterleave(string s1, string s2, string s3) { int n = s1.length(), m = s2.length(), l3 = s3.length(); if (n + m != l3)原创 2015-03-19 09:49:57 · 304 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Valid Parentheses
Valid Parenthesesclass Solution {public: bool leftBrace(char ch) { return ch == '(' || ch == '{' || ch == '['; } bool isMatch(char lc, char rc) { return lc == '(' && r原创 2015-03-19 10:00:41 · 320 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Maximum Subarray
Maximum Subarrayclass Solution {public: int maxSubArray(int A[], int n) { int ans = 0, cs = 0; if (n == 0) return 0; ans = cs = A[0]; for (int i = 1; i < n; ++原创 2015-03-19 09:54:23 · 313 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Sort Colors
Sort Colorsclass Solution {public: void swap(int &a, int &b) { int c = a; a = b; b = c; } void sortColors(int A[], int n) { const int red = 0, white =原创 2015-03-16 10:19:32 · 312 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Median of Two Sorted Arrays
Median of Two Sorted Arraysclass Solution {public: int findkth(int* A, int m, int* B, int n, int k) { if (m + n < k) { return -1; //out of range } if (m ==原创 2015-03-16 14:24:02 · 302 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Path Sum II
Path Sum II/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * };原创 2015-03-16 22:55:15 · 302 阅读 · 0 评论 -
POJ 1470 Closest Common Ancestors - Tarjan
POJ 1470 Closest Common AncestorsWiki 上的 Tarjan 算法, Tarjan is an offline algorithmhttp://en.wikipedia.org/wiki/Tarjan's_off-line_lowest_common_ancestors_algorithmfunction TarjanOLCA(u) Ma原创 2015-03-20 11:37:43 · 437 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Scramble String
Scramble Stringclass Solution {public: bool isScramble2(string s1, string s2) { int n = s1.length(); if (n <= 3) return true; //from left int match = 0;原创 2015-03-17 10:57:29 · 488 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Rotate Array
Rotate Arrayclass Solution {public: void reverse(int nums[], int st, int ed) { while (st < ed) { int k = nums[st]; nums[st] = nums[ed]; nums[ed] =原创 2015-04-02 23:37:03 · 267 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Best Time to Buy and Sell Stock
Best Time to Buy and Sell Stockclass Solution {public: int maxProfit(vector &prices) { int n = prices.size(); if (n <= 1) return 0; int profit = 0, minvalue = prices[0原创 2015-04-02 18:49:29 · 319 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Best Time to Buy and Sell Stock II
Best Time to Buy and Sell Stock IIclass Solution {public: int maxProfit(vector &prices) { int n = prices.size(); int profit = 0; for (int i = 1; i < n; ++i) {原创 2015-04-02 18:53:01 · 318 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -LRU Cache
LRU Cachetypedef map >::iterator>::iterator mplstiter;typedef list >::iterator lstiter;class LRUCache{private: int _cap; map mp; list > lst;public: LRUCache(int capacity) {原创 2015-04-02 23:31:40 · 353 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Rotate Image
Rotate Imageclass Solution {public: void rotate(vector > &matrix) { int n = matrix.size(); if (n <= 1) return; for (int i = 0; i < n / 2; ++i) { int st = i原创 2015-04-02 18:30:39 · 293 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Spiral Matrix II
Spiral Matrix IIclass Solution {public: vector > generateMatrix(int n) { int dir[][2] = {{0,1}, {1,0}, {0,-1}, {-1,0}}; vector > mat; mat.resize(n); for(int i原创 2015-04-02 18:46:35 · 298 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Reverse Integer
Reverse Integerclass Solution {public: int reverse(int x) { int positive = 1; long long xx = x; if (xx < 0) { positive = -1; xx = -xx;原创 2015-04-17 18:12:29 · 259 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Longest Common Prefix
Longest Common Prefixclass Solution {public: string longestCommonPrefix(vector& strs) { int n = INT_MAX; for (int i = 0; i < strs.size(); ++i) { n = min(n, int(str原创 2015-04-17 18:30:47 · 255 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Happy Number
Happy Numberclass Solution {public: int getNext(int n) { int m = 0; while (n) { m += (n % 10) * (n % 10); n /= 10; } vector nums;原创 2015-04-22 15:32:20 · 302 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Remove Duplicates from Sorted List
Remove Duplicates from Sorted List/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */cla原创 2015-04-18 16:48:25 · 239 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Linked List Cycle II
Linked List Cycle II/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {原创 2015-04-22 16:50:27 · 290 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Intersection of Two Linked Lists
Intersection of Two Linked Lists/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class原创 2015-04-22 16:16:18 · 260 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Linked List Cycle
Linked List Cycle/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {pub原创 2015-04-22 16:32:06 · 333 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Partition List
Partition List/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public原创 2015-04-18 16:28:42 · 274 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Maximal Rectangle
Maximal Rectangleclass Solution {public: int maxhis(const vector hist) { stack > st; int maxarea = 0; for (int i = 0; i <= hist.size(); ++i) { int h = i ==原创 2015-04-18 16:40:55 · 264 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Largest Rectangle in Histogram
Largest Rectangle in Histogramclass Solution {public: int largestRectangleArea(vector& height) { stack > st; int maxarea = 0; for (int i = 0; i <= height.size(); ++i)原创 2015-04-18 16:44:26 · 261 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Remove Duplicates from Sorted List II
Remove Duplicates from Sorted List II/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */原创 2015-04-18 16:57:17 · 303 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Remove Duplicates from Sorted Array II
Remove Duplicates from Sorted Array IIclass Solution {public: int removeDuplicates(int A[], int n) { if (n <= 1) return n; int m = 1; for (int i = 1; i < n; ++i) {原创 2015-04-18 17:02:55 · 268 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Evaluate Reverse Polish Notation
Evaluate Reverse Polish Notationclass Solution {public: int a2i(const string &s) { int n = 0, neg = 1; for (int i = 0; i < s.length(); ++i) { if (s[i] == '-' && i原创 2015-04-22 16:27:34 · 304 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Generate Parentheses
Generate Parenthesesclass Solution {public: void gen(int le, int ri, int n, vector &vs, string &s) { if (le == ri && ri == n) { vs.push_back(s); return ;原创 2015-04-07 00:28:55 · 293 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Add Two Numbers
Add Two Numbers/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {publi原创 2015-04-07 00:40:02 · 399 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Binary Tree Right Side View
Binary Tree Right Side View/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(原创 2015-04-14 20:08:26 · 287 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Word Ladder
Word Ladderclass Solution {public: int ladderLength(string beginWord, string endWord, unordered_set& wordDict) { if(beginWord == endWord) { return 1; } que原创 2015-04-14 15:50:20 · 370 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Number of Islands
Number of Islandsclass Solution { const static int dir[][2];public: void markstart(vector >&grid, int r, int c) { int n = grid.size(), m = grid[0].size(); queue q;原创 2015-04-14 20:22:07 · 292 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -House Robber
House Robberclass Solution {public: int rob(vector &num) { int dp[2]; dp[0] = dp[1] = 0; for (int i = 0; i < num.size(); ++i) { int a = max(dp[0], dp[1]);原创 2015-04-14 20:27:40 · 299 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -ZigZag Conversion
ZigZag Conversionclass Solution {public: string convert(string s, int nRows) { string ret = ""; if (nRows <= 1) { return s; } int n = s.length();原创 2015-04-13 23:54:05 · 289 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Largest Number
Largest Numberbool cmp(const string &s1, const string &s2) { string s3 = s1 + s2, s4 = s2 + s1; return s3 > s4;}class Solution {public: string itos(int n) { string s;原创 2015-04-14 23:29:13 · 286 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Dungeon Game
Dungeon Gameclass Solution {public: bool can(const vector > &dungeon, int v) { int n = dungeon.size(); int m = dungeon[0].size(); vector > td = dungeon; if (td原创 2015-04-14 23:23:25 · 290 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Bitwise AND of Numbers Range
Bitwise AND of Numbers Rangeclass Solution {public: int rangeBitwiseAnd(int m, int n) { long long a = max(m, n); long long b = min(m, n); if (b == 0) { ret原创 2015-04-16 10:32:19 · 413 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Valid Palindrome
Valid Palindromeclass Solution {public: bool isPalindrome(string s) { int st = 0, ed = s.length(); if (ed == 0) { return true; } while (st < ed) {原创 2015-04-24 14:10:39 · 335 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Longest Consecutive Sequence
Longest Consecutive Sequenceclass Solution {public: int longestConsecutive(vector &num) { int n = num.size(); if (n <= 1) { return n; } unordered_m原创 2015-04-20 20:37:35 · 278 阅读 · 0 评论 -
leetcode 日经贴,Cpp code -Remove Linked List Elements
Remove Linked List Elements/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solu原创 2015-04-24 13:54:25 · 349 阅读 · 0 评论