摘要：
Business Model canvas The idea of the course strategic market analysis corporate strategy design of the organizational systems and system for the mana 阅读全文
摘要：
！！！题目链接！！！ Solution: /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr) {} 阅读全文
摘要：
！！！题目链接！！！ 解决方案 /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr) {} * Li 阅读全文
摘要：
！！！题目链接！！！ Solution: class Solution { public: string reverseWords(string s) { int le = s.size()-1; int ri = s.size()-1; reverse(s.begin(), s.end()); s 阅读全文
摘要：
！！！题目链接！！！ Solution: class Solution { public: void moveZeroes(vector<int>& nums) { int le = 0; int ri = 0; while(ri != nums.size()) { if(nums[ri] != 0 阅读全文
摘要：
！！！题目链接！！！ Solution: class Solution { public: vector<int> twoSum(vector<int>& numbers, int target) { int le = 0; int ri = numbers.size()-1; vector<int 阅读全文
摘要：
！！！题目链接！！！ Solution: class Solution { public: void moveZeroes(vector<int>& nums) { int le = 0; int ri = 0; while(ri != nums.size()) { if(nums[ri] != 0 阅读全文
摘要：
！！！题目链接！！！ Solution: class Solution { public: void rotate(vector<int>& nums, int k) { vector<int> result(0); if(k > nums.size()) k = k%nums.size(); re 阅读全文
摘要：
！！！题目链接！！！ Solution: class Solution { public: vector<int> sortedSquares(vector<int>& nums) { vector<int> result(nums.size()); int le = 0; int ri = num 阅读全文
摘要：
！！！题目链接！！！ Solution： class Solution { public: int searchInsert(vector<int>& nums, int target) { int max = nums.size() -1 ; int min = 0; int mid = 0; i 阅读全文