贪心算法
class Solution:
# @param gas, a list of integers
# @param cost, a list of integers
# @return an integer
def canCompleteCircuit(self, gas, cost):
# write your code here
m = 0
n = len(gas)
start = 0
while start < n:
gas_sum = 0
cost_sum = 0
m = start
while m < n:
gas_sum += gas[m]
cost_sum += cost[m]
if gas_sum < cost_sum:
break
m += 1
k = 0
if m == n:
while k < start:
gas_sum += gas[k]
cost_sum += cost[k]
if gas_sum < cost_sum:
break
k += 1
if k == start:
return start
start = m + 1
return -1