happylife39的博客

/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * };

class Solution { public: bool containsNearbyDuplicate(vector& nums, int k) { //map

class Solution { public: bool isPalindrome(int x) { if(x<0|| (x!=0 &&x%10==0)) return false; int sum=0; while(x>sum) { sum = sum*10+x%10; x =

class Solution { public: vector<int> twoSum(vector<int>& nums, int target) { vector<int> result; if(nums.size()<2) return result; unordered_map<int ,int> m;

class Solution { public: int longestValidParentheses(string s) { //使用DP，vector<int> res(s.size()), res[i]代表从s[j->i]的匹配圆括号数目 int n = s.size(); if(n<=1) return 0;

/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode* sor