Algorithm - 随笔分类(第11页) - 卖程序的小歪

LeetCode Restore IP Addresses

摘要：class Solution {public: vector restoreIpAddresses(string s) { vector ips; vector ip; dfs(s, 0, ip, ips); return ips; ... 阅读全文

posted @ 2014-07-05 08:55 卖程序的小歪阅读(170) 评论(0) 推荐(0)

LeetCode Plus One

摘要：class Solution {public: vector plusOne(vector &digits) { int carry = 1; int len = digits.size(); vector res; ... 阅读全文

posted @ 2014-07-04 23:41 卖程序的小歪阅读(237) 评论(0) 推荐(0)

LeetCode Reverse Linked List II

摘要：class Solution {public: ListNode *reverseBetween(ListNode *head, int m, int n) { if (head == NULL || n 0) { pre = cur; ... 阅读全文

posted @ 2014-06-30 11:14 卖程序的小歪阅读(162) 评论(0) 推荐(0)

LeetCode Pascal's Triangle

摘要：class Solution {public: vector > generate(int numRows) { vector > res; if (numRows row(1, 1); res.push_back(row); ... 阅读全文

posted @ 2014-06-30 10:29 卖程序的小歪阅读(187) 评论(0) 推荐(0)

LeetCode Pascal's Triangle II

摘要：class Solution {public: vector getRow(int rowIndex) { int half = (rowIndex + 1) / 2; int len = half * 2 + !(rowIndex & 0x1); ... 阅读全文

posted @ 2014-06-30 09:58 卖程序的小歪阅读(178) 评论(0) 推荐(0)

LeetCode Partition List

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

posted @ 2014-06-30 08:58 卖程序的小歪阅读(162) 评论(0) 推荐(0)

LeetCode Combinations

摘要：class Solution {private: vector > res;public: vector > combine(int n, int k) { res.clear(); vector path; dfs(1, n, k, path)... 阅读全文

posted @ 2014-06-28 22:02 卖程序的小歪阅读(111) 评论(0) 推荐(0)

LeetCode Minimum Path Sum

摘要：class Solution {public: int minPathSum(vector > &grid) { int rows = grid.size(); if (rows pathsum(cols + 1, INT_MAX); pathsum... 阅读全文

posted @ 2014-06-28 21:47 卖程序的小歪阅读(147) 评论(0) 推荐(0)

LeetCode Valid Palindrome

摘要：class Solution {public: bool isPalindrome(string s) { int len = s.length(); //if (len -1 && !(b = check2lower(s[q])) ); i... 阅读全文

posted @ 2014-06-28 21:00 卖程序的小歪阅读(179) 评论(0) 推荐(0)

LeetCode Longest Consecutive Sequence

摘要：class Solution {public: int longestConsecutive(vector &num) { int len = num.size(); int max_cons = 0; int cur_cons = 0... 阅读全文

posted @ 2014-06-28 20:16 卖程序的小歪阅读(170) 评论(0) 推荐(0)

LeetCode Remove Element

摘要：class Solution {public: int removeElement(int A[], int n, int elem) { if (A == NULL || n < 1) return 0; int rpos = 0, wpos = 0; ... 阅读全文

posted @ 2014-06-24 14:42 卖程序的小歪阅读(122) 评论(0) 推荐(0)

LeetCode Reverse Integer

摘要：class Solution {public: int reverse(int x) { bool neg = x = 0; 8 while (x) { 9 int d = x % 10;10 if (positiv... 阅读全文

posted @ 2014-06-24 14:34 卖程序的小歪阅读(156) 评论(0) 推荐(0)

LeetCode Same Tree

摘要：/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(... 阅读全文

posted @ 2014-06-24 14:27 卖程序的小歪阅读(179) 评论(0) 推荐(0)

LeetCode Maximum Depth of Binary Tree

摘要：/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(... 阅读全文

posted @ 2014-06-24 14:19 卖程序的小歪阅读(128) 评论(0) 推荐(0)

LeetCode 3Sum Closest

摘要：class Solution {public: int threeSumClosest(vector &num, int target) { int len = num.size(); if (len target) { q-... 阅读全文

posted @ 2014-06-24 11:07 卖程序的小歪阅读(124) 评论(0) 推荐(0)

LeetCode Linked List Cycle

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

posted @ 2014-06-24 10:36 卖程序的小歪阅读(135) 评论(0) 推荐(0)

LeetCode Best Time to Buy and Sell Stock II

摘要：class Solution {public: int maxProfit(vector &prices) { int len = prices.size(); if (len &prices) { int len = prices.size(); ... 阅读全文

posted @ 2014-06-24 02:19 卖程序的小歪阅读(159) 评论(0) 推荐(0)

LeetCode Balanced Binary Tree

摘要：/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(... 阅读全文

posted @ 2014-06-23 21:58 卖程序的小歪阅读(182) 评论(0) 推荐(0)

LeetCode Validate Binary Search Tree

摘要：/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(... 阅读全文

posted @ 2014-06-23 21:39 卖程序的小歪阅读(120) 评论(0) 推荐(0)

LeetCode Linked List Cycle II

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

posted @ 2014-06-20 19:05 卖程序的小歪阅读(163) 评论(0) 推荐(0)

卖程序的小歪

随笔分类 - Algorithm

公告