zwzcdcll的博客

leetcode96 Unique Binary Search Trees原题链接：https://leetcode-cn.com/problems/unique-binary-search-trees/参考链接：http://www.cnblogs.com/springfor/p/3884009.htmlhttp://blog.youkuaiyun.com/linhuanmars/article/...

#include<string>#include<iostream>//using std::string;using namespace std;class Solution {public:int lengthOfLongestSubstring(string s) { // 暴力搜索改良版，O（N^2） int index = 0; /...

#include<iostream>#include<stack>#include<string>using namespace std;class Solution {public: bool isValid(string s) { stack<char> sta; if(s[0] == '(' ||...

#include<iostream>#include<string>#include<vector>using namespace std;class Solution {public: vector<string> generateParenthesis(int n) { int left = n; int righ...

#include<iostream>#include<vector>using namespace std;class Solution{public: int removeDuplicates(vector<int> &nums){ int size = nums.size(); int index = 0; for(in...

#include<iostream>using namespace std;struct ListNode{ int value; ListNode *next; ListNode(int x):value(x),next(NULL){}};//https://blog.youkuaiyun.com/linhuanmars/article/details/24389429//h...

#include<iostream>#include<vector>using namespace std;class Solution {public: int removeDuplicates(vector<int>& nums) { if(nums.empty()){ return 0; } int index...

#include<iostream>using namespace std;struct ListNode{ int val; ListNode *next; ListNode(int x): val(x),next(NULL){}}class solution{public: ListNode* reverseBetween(ListNode *head,int...

#include<iostream>using namespace std;struct ListNode{ int val; ListNode *next; ListNode(int x):val(x),next(NULL){}};//https://leetcode-cn.com/problems/reverse-linked-list/solution/die-...

#include<iostream>#include<string>#include<vector>using namespace std;class Solution {public: string longestCommonPrefix(vector<string>& strs) { int size = str...

package leetcode.simple;import java.util.ArrayList;import java.util.List;/*push(x) -- 将元素 x 推入栈中。pop() -- 删除栈顶的元素。top() -- 获取栈顶元素。getMin() -- 检索栈中的最小元素。 */class MinStack { List<Integ...