上一页 1 ··· 6 7 8 9 10 11 下一页
摘要: /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x... 阅读全文
posted @ 2015-07-22 21:37 *桔子* 阅读(134) 评论(0) 推荐(0)
摘要: /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x... 阅读全文
posted @ 2015-07-22 21:08 *桔子* 阅读(169) 评论(0) 推荐(0)
摘要: class Solution {public: bool isPalindrome(string s) { if(s=="") return true; int i=0; string s1; while(i='A' && s[i]='a... 阅读全文
posted @ 2015-07-22 20:08 *桔子* 阅读(119) 评论(0) 推荐(0)
摘要: 二叉树 阅读全文
posted @ 2015-07-22 19:53 *桔子* 阅读(127) 评论(0) 推荐(0)
摘要: /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * };... 阅读全文
posted @ 2015-07-22 10:08 *桔子* 阅读(203) 评论(0) 推荐(0)
摘要: 第一种解法,记录每一出现的元素/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(... 阅读全文
posted @ 2015-07-21 20:39 *桔子* 阅读(173) 评论(0) 推荐(0)
摘要: /**注意往链表头插入元素的情况 * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NU... 阅读全文
posted @ 2015-07-21 19:58 *桔子* 阅读(185) 评论(0) 推荐(0)
摘要: class Solution {public: void reverseWords(string &s) { string::iterator it; int i=0; it= s.begin(); while(it!=s.end() && (*it==' ' || *it=='\t'))... 阅读全文
posted @ 2015-07-21 19:05 *桔子* 阅读(123) 评论(0) 推荐(0)
摘要: #includeclass Solution {public: int findMin(vector& nums) { if(nums.size()==0) return INT_MIN; if(nums.size()==1) return nums[0];... 阅读全文
posted @ 2015-07-20 21:01 *桔子* 阅读(136) 评论(0) 推荐(0)
摘要: class MinStack {public: void push(int x) { ele.push(x); if(min.empty()||x ele; stack min;}; 阅读全文
posted @ 2015-07-20 13:31 *桔子* 阅读(165) 评论(0) 推荐(0)
上一页 1 ··· 6 7 8 9 10 11 下一页