[leetcode] 134. Gas Station

转载 2016年08月29日 11:04:33

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

You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i 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.

Note:
The solution is guaranteed to be unique.

解法一:

dp解法没有通过OJ testtime。

class Solution {
public:
    int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
        int len = gas.size();
        vector<int> dp(len,0); //gas when arrives station i
        
        for(int i=0; i<len; i++){
            int step = 0;
            for(int j=i; j<len+i; j++){
                int cur = j<len?j:j-len;
                int next = j+1<len?j+1:j+1-len;
                dp[next] = dp[cur]+gas[cur]-cost[cur];
                if(dp[next]<0){
                    dp[next] = 0;
                    break;
                }
                step++;
            }
            if(step==len) return i;
        }
        return -1;
    }
};


解法二:

如果整个过程中gas的总和大于cost,肯定可以走一圈。有了整个前提,就是遍历一遍数组,sum表示走到当前位置i,还剩的汽油,如果小于零,说明之前假设的出发位置不对,将始发位置改为i+1,sum置为零。

class Solution {
public:
    int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
        int len = gas.size();
        int total = 0, sum =0, start = 0;
        
        for(int i=0; i<len; i++){
            total += gas[i]-cost[i];
            sum += gas[i]-cost[i];
            if(sum<0){
                start = i+1;
                sum = 0;
            }
        }
        
        if(total<0) return -1;
        else return start;
    }
};






相关文章推荐

[leetcode] 134 Gas Station(经典dp || 贪心)

(一)最容易想到的是O(n2)的解法 预处理出gas[i] - cost[i] 的数组,从每个非负的位置开始尝试,只要能够完成一个循环,就可以输出结果; 对于返回-1的情况,我们经过思考和推论可以...
  • NK_test
  • NK_test
  • 2015年09月28日 14:31
  • 1633

LeetCode 134 Gas Station 题解

题意简述:有n个加油站,呈环形分布在一条公路上。给出每个加油站所能提供的油量gas,和从一个加油站到达下一个加油站消耗的油量cost。假设车的油缸可以装无限的汽油,那么能否找到一个出发点,使车能够绕公...

LeetCode-134. Gas Station(JAVA)加气站问题

LeetCode-134. Gas Station(JAVA)加气站

[LeetCode] 134. Gas Station

There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. Yo...

LeetCode 134. Gas Station

大概题意:有n个车站,给定两个数组gas 和 cost。对于任意车站i,gas[i]表示在车站i能够加的油的升数,cost[i]表示从车站i开向车站i + 1(车站n-1则是开向车站0)所要耗费的油的...
  • isNoel
  • isNoel
  • 2016年11月23日 22:55
  • 145

LeetCode(134)Gas Station

题目如下: There are N gas stations along a circular route, where the amount of gas at station i is gas[...

[leetcode] 【数组】134. Gas Station

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

【LeetCode】134. Gas Station

题目There are N gas stations along a circular route, where the amount of gas at station i is gas[i].Yo...

[leetcode] 134 Gas Station

题目: There are N gas stations along a circular route, where the amount of gas at station i is gas[i]...

Leetcode——134. Gas Station && 435. Non-overlapping Intervals

Gas Station 1. 问题描述 有N个加油站围成一个圈,第i个加油站的油量是gas[i],一辆车有一个无限量的油箱,每次从第i个加油站开到第i+1个加油站需要消耗cost[i]的油量。车一开始...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:[leetcode] 134. Gas Station
举报原因:
原因补充:

(最多只允许输入30个字)