qtmatt的博客

class Solution {public: int jump(vector<int>& nums) { if(nums.size()==1)return 0;//特判 int l=0,r=0,steps=0;//这题主要还是滚动区间的思想 while(l<=r)//设置左右区间 { ...

class Solution {public: int canCompleteCircuit(vector<int>& gas, vector<int>& cost) { int n=gas.size(); for(int i=0,j;i<n;i+=j+1)//剪枝优化 { ...

class Solution {public: string removeKdigits(string num, int k) { if(k==num.size())return "0"; string res; for(char c:num)//思路是把非完全升序的pop掉，留下递增序列如果pop掉不满k，再从尾部p...