- 博客(13)
- 收藏
- 关注
RSS订阅原创 101
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */class Solutio...
2020-04-25 12:12:07
87
原创 89
class Solution {public: vector<int> grayCode(int n) { int k = 1; vector<int> ans; while(n >= 0){ if(ans.size() == 0) ...
2020-04-19 10:58:32
77
原创 136
class Solution {public: int singleNumber(vector<int>& nums) { int x=0; for(int i=0; i<nums.size(); i++){ x^= nums[i]; } ...
2020-04-12 16:42:25
170
原创 344
class Solution {public: void reverseString(vector<char>& s) {int n=s.size(); for(int i=0;i<n/2;i++) { swap(s[i],s[n-1-i]); } }};
2020-04-05 17:01:19
69
原创 14
class Solution {public: string longestCommonPrefix(vector<string>& strs) {if(strs.size()==0)return "";for(int i=0;i<strs[0].size();i++)for(int j=1;j<strs.size();j++)if(strs[j][i...
2020-04-05 16:10:12
213
原创 7
class Solution {public: int reverse(int x) { int y=0; while(x!=0) { if(y>INT_MAX/10||y<INT_MIN/10)return 0; y=y*10+x%10; x=x/10; } return y; } };
2020-03-29 10:11:00
35
原创 155
class MinStack {public: /** initialize your data structure here. */ MinStack() {} void push(int x) {s.push(x); if(z.empty()){z.push(x);} else{ int t = z.top(); if(x<t)z.push(x);...
2020-03-22 13:56:18
101
原创 141
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: bool hasCycle(ListNode...
2020-03-15 11:24:18
60
原创 83
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */class Solution {public: ListNode* deleteDupl...
2020-03-14 12:39:02
64
原创 122
class Solution {public: int maxProfit(vector<int>& prices) { int k=0; if(prices.empty()) return 0; for(int i=1;i<prices.size();i++) { ...
2020-03-08 11:21:46
55
原创 88
在这里插入代码片class Solution {public: void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) { int i=0; while(i<n){nums1[m++]=nums2[i];i++;} for(int...
2020-03-01 11:32:14
128
原创 53
class Solution {public: int maxSubArray(vector<int>& nums) { int k=0; int t=0; int s=0; for(int i=0;i<nums.size();i++) { if(nums[i]>0...
2020-03-01 11:31:11
50
原创 121
class Solution {public: int maxProfit(vector<int>& prices) { int min=0; if(prices.empty()) return 0; for(int i=0;i<prices.size()-1;i++) { for(int j=i+1;j&...
2020-03-01 11:30:03
46
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人