2018年06月_VigorQQ

原创 leetcode-101-symmetric tree

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

2018-06-24 22:07:38 128

原创 leetcode-100-same tree

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

2018-06-24 21:55:02 134

原创 leetcode-88-merge sorted array

class Solution {public: void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) { int count = m + n - 1; m = m - 1; n = n - 1; while(c...

2018-06-24 20:57:47 109

原创 leetcode-83-remove duplicates from sorted lists

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

2018-06-24 12:18:41 133

原创 leetcode-70-climb stairs

class Solution {public: int climbStairs(int n) { int dp[3]; dp[0]=1; dp[1]=2; int i=n; while(i > 2){ dp[2]=dp[0]+dp[1]; dp[0]=dp...

2018-06-17 13:22:32 139

原创 leetcode-69-Sqrt()

class Solution {public: int mySqrt(int x) { if(x<=1) return x; int left=0, right=x; while(left<right){ int mid = left + (right-left)/2; ...

2018-06-15 22:00:20 78

原创 leetcode-67-add binary

class Solution {public: string addBinary(string a, string b) { int lena = a.size(); int lenb = b.size(); string result=""; int i=lena-1, j=lenb-1; int flag...

2018-06-15 21:40:17 117

原创 leetcode-66-plus one

class Solution {public: vector<int> plusOne(vector<int>& digits) { int len = digits.size(); for(int i=len-1;i>=0;i--){ if(digits[i] == 9) ...

2018-06-15 20:48:10 108

原创 leetcode-58-length of last word

class Solution {public: int lengthOfLastWord(string s) { if(s.empty()) return 0; int result=0; for(int i=s.size()-1;i>=0;i--){ if(s[i]!=' ') ...

2018-06-15 17:11:11 123

原创 leetcode-53-maxium subarray

class Solution {public: int maxSubArray(vector<int>& nums) { int cur=0; int sum = INT_MIN; for(int i=0; i<nums.size();i++){ if(cur<=0) ...

2018-06-15 16:58:46 89

原创 leetcode-38-count and say

class Solution { private: string Count(string s)//计算下一个序列 { string result; int i=0; int count ; while (i < s.size()) { ...

2018-06-15 16:35:59 119

原创 leetcode-35-search insert position

class Solution {public: int searchInsert(vector<int>& nums, int target){ for(int i =0; i<nums.size();i++){ if(nums[i]>=target) return i; ...

2018-06-15 16:19:39 128

原创 leetcode-28-implement strStr()

class Solution {public: int strStr(string haystack, string needle) { if(needle == "") return 0; int lenHay = haystack.size(); int lenNee = needle.size(); ...

2018-06-14 21:47:13 101

原创 leetcode-27-remove elements

class Solution {public: int removeElement(vector<int>& nums, int val) { vector<int>::iterator it=nums.begin(); while(it != nums.end()){ if(*it == val){...

2018-06-14 21:16:48 97

原创 leetcode-26-remove duplicates from sorted array

class Solution {public: int removeDuplicates(vector<int>& nums) { vector<int>::iterator it=nums.begin(); vector<int>::iterator it_1 = it; it_1++; ...

2018-06-14 21:11:43 103

原创 leetcode-21-merge two sorted lists

class Solution {public: ListNode* mergeTwoLists(ListNode* l1, ListNode* l2) { if(l1 == NULL) return l2; if(l2 == NULL) return l1; ListNode *lp=NULL...

2018-06-14 19:56:17 170

原创 leetcode-20-valid parentheses

class Solution {public: bool isValid(string s) { if(s.empty()) return true; stack<char> result; for(auto x:s){ if(x == '(' || x == '[' || x =...

2018-06-14 17:31:48 108

原创 leetcode-14-longest common prefix

class Solution {public: string longestCommonPrefix(vector<string>& strs) { string result=""; if(strs.empty()) return result; int len = strs.size(); ...

2018-06-14 16:44:13 111

原创 leetcode-13-roman to integer

class Solution {public: int romanToInt(string s) { int len = s.size(); int num=0; for(int i=0;i<len;i++){ if(s[i] == 'I' && (s[i+1] == 'V' || s[i+1]...

2018-06-14 16:15:05 108

原创 leetcode-09-palindrome number

class Solution {public: bool isPalindrome(int x) { if(x < 0) return false; vector<int> result; int k,j=0,l=0; while(x != 0){ k = x...

2018-06-14 15:55:52 99

原创 leetcode-04-两个排序数组的中位数

class Solution {public: double findMedianSortedArrays(vector<int>& nums1, vector<int>& nums2) { int length1 = nums1.size(); int length2 = nums2.size(); ...

2018-06-07 09:27:20 153

原创 leetcode-03-无重复字符的最长子串

class Solution {public: int lengthOfLongestSubstring(string s) { int length = s.size(); int max = 0, cur=0; char single; map<char, int> countChar; fo...

2018-06-06 20:47:40 173

转载 leetcode-02-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...

2018-06-06 15:18:13 100

原创 leetcode-01-two sum

class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { vector<int> sum;// if( nums.size() == 0 || nums.size() == 1 ){// retu...

2018-06-06 15:10:25 87

VigorQQ的博客