weixin_46589819的博客

0515刷题自用代码class Solution {public: string reverseLeftWords(string s, int n) { string a,b; int num=s.length(); s+=s; return s.substr(n,num); }};思路例如：s=“abcdef”,n=3s=s+s=‘abcdefabcdef’s.substr(n,num) 复制s+s的第n到n

刷题自用0515代码class Solution {public: ListNode *getIntersectionNode(ListNode *headA, ListNode *headB) { ListNode *a=headA; ListNode *b=headB; while(headA!=headB){ headA=headA==NULL?b:headA->next; headB=headB==N

0517刷题自用题目描述某二叉树的前序遍历和中序遍历的结果，请构建该二叉树并返回其根节点代码class Solution {public: TreeNode* buildTree(vector<int>& preorder, vector<int>& inorder) { if(preorder.size()==0&&inorder.size()==0) return NULL; auto headro

刷题自用0517问题描述F(0) = 0, F(1) = 1F(N) = F(N - 1) + F(N - 2), 其中 N > 1.代码class Solution {public: int fib(int n) { int left=0; int right=1; int sum=0; if(n<2) return n; for(int i=2;i<=n;i++){

刷题自用0518代码class Solution {public: vector<int> twoSum(vector<int>& nums, int target) { int left=0; int n=nums.size(); int right=n-1; vector <int> res; while(left<right){ if

刷题自用代码class Solution {public: bool findNumberIn2DArray(vector<vector<int>>& matrix, int target) { int a=matrix.size()-1; int b=0; while(a>=0&&b<matrix[0].size()){ if(target<matrix[

刷题自用代码class Solution {public: int findRepeatNumber(vector<int>& nums) { unordered_map <int,int>res; for(auto a:nums){ ++res[a]; if(res[a]>1) return a; } return 0;

代码![在这里插入代码片]class Solution {public: bool isStraight(vector<int>& nums) { sort(nums.begin(),nums.end()); int zero=0; int n=nums.size(); for(int i=0;i<4;i++){ if(nums[i]==0){ zer

代码class Solution {public: int maxValue(vector<vector<int>>& grid) { int dp[205][205] = {0}; int n = grid.size(), m = grid[0].size(); dp[0][0] = grid[0][0]; for(int i = 1; i < m; i++) { dp

代码class Solution {public: string replaceSpace(string s) { string res; for(auto t:s){ if(t==' '){ res.push_back('%'); res.push_back('2'); res.push_back('0'); }

代码class Solution {public: int findRepeatNumber(vector<int>& nums) { unordered_map <int,int>res; for(auto i:nums){ ++res[i]; if(res[i]>1) return i; } return 0;