class Solution {
public:intcanCompleteCircuit(vector<int>& gas, vector<int>& cost){int pre =0;int cur;int result =0;int sumGas =0;for(int i =0; i < gas.size(); i++){
sumGas = sumGas + gas[i]- cost[i];
cur = gas[i]- cost[i];// 存在一个点能到达之后的所有点if(pre <=0&& cur >0){
result = i;
pre =0;}
pre = pre + gas[i]- cost[i];}// 能跑完全程return(sumGas >=0)? result :-1;}};
class Solution {
public:intcandy(vector<int>& ratings){
vector<int>candy(ratings.size(),1);// 左右各遍历一次for(int i =1; i < ratings.size(); i++){if(ratings[i]> ratings[i-1])
candy[i]= candy[i-1]+1;}for(int i = ratings.size()-2; i >=0; i--){if(ratings[i]> ratings[i+1]){
candy[i]=max(candy[i+1]+1, candy[i]);}}int result =0;for(int i : candy){
result += i;}return result;}};