Leetcode
ZXR_LJ
这个作者很懒,什么都没留下…
展开
-
Leetcode 53. Maximum Subarray
53. Maximum Subarray题目:Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous...原创 2018-03-30 21:17:04 · 283 阅读 · 1 评论 -
Leetcode 121. Best Time to Buy and Sell Stock
121. Best Time to Buy and Sell Stock class Solution {public: int maxProfit(vector<int>& prices) { int max = 0; int current = 0; int next = 0; if(pr...原创 2018-03-30 21:56:26 · 150 阅读 · 0 评论 -
Leetcode 65. Valid Number
答案: class Solution {public: bool isNumber(string s) { int i = 0; int n_pt,n_num;//记录点和数字的个数 for(; s[i] == ' '; i++) {}//去除开头的空格 if(s[i] == '+' || s[i] ==...原创 2018-04-05 22:02:10 · 153 阅读 · 0 评论 -
Leetcode 22. Generate Parentheses
题目: 题目思路: 使用两个整数来计算剩余的左括号(n)和右括号(m)。 在每个函数调用中,如果n> 0,则添加左括号,如果m> 0,则添加右括号。 当m和n都为零时追加结果并终止递归调用。这是一道很经典的递归调用题目。 class Solution {public: vector<string> generateParenthesis(int...原创 2018-04-06 19:56:53 · 163 阅读 · 0 评论 -
Leetcode 24.Swap Nodes in Pairs
题目代码: ListNode* swapPairs(ListNode* head) { ListNode **pp = &head, *a, *b; while ((a = *pp) && (b = a->next)) { a->next = b->next; b->next = a; ...原创 2018-04-06 22:25:57 · 148 阅读 · 0 评论