- 博客(5)
- 收藏
- 关注
RSS订阅原创 LeetCode 213:House Robber II
class Solution { public: int rob(vector& nums) { int length = nums.size(); //cout << "length = " << length << endl; int dp[10000] = {0}; int max1 = 0; int max2 = 0; if (length == 0){ r
2017-04-27 22:54:57
224
原创 Add Two Numbers
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode* ad
2017-04-24 21:32:18
201
原创 Merge Two Sorted Lists
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode* me
2017-04-24 16:01:40
229
原创 Valid Parentheses
#include #include #include using namespace std; class Solution { public: bool isValid(string s) { int length = s.size(); int i = 1; stack temp; if (length == 0){ return false; } temp.
2017-04-24 15:08:18
234
原创 leetcode RomanToInt
class Solution { public: //罗马数字规律问题求解，寻找加减规律 //当前字符与前一字符代表的value,关系为解题关键 //罗马字符表如上图所示 int romanToInt(string s) { int length = s.size(); map roman; int res; roman['I'] = 1; roma
2017-04-23 09:59:11
275
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人