Gas Station--LeetCode

野性酷女 2022-08-07 13:54 238阅读 0赞

There are N gas stations along a circular route, where the amount of gas at stationi isgas[i].

You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from stationi to its next station (i+1). You begin the journey with an empty tank at one of the gas stations.

Return the starting gas station’s index if you can travel around the circuit once, otherwise return -1.

  1. #include <iostream>
  2. #include <vector>
  4. int canCompleteCircuit(vector<int> &gas, vector<int> &cost) {
  5.     int index,cur;
  6.     int len = gas.size();
  7.     int begin=0,curNum;
  8.     for(begin =0;begin<gas.size();begin++)
  9.     {
  10.        cur =0;
  11.        curNum=0;
  12.        index = begin;
  13.        while(curNum<len)
  14.        {
  15.           index = index%len;
  16.           cur +=cost[index];
  17.           if(cur< cost[index])
  18.            break;
  19.           else
  20.             cur -=cont[index];
  21.           curNum++;
  22.           index++;
  23.      }
  24.        if(curNum == len)
  25.        return begin;
  26.     }
  27.     return -1;   
  28. }

发表评论

表情：
评论列表 （有 0 条评论，238人围观）

还没有评论，来说两句吧...

相关阅读