N个环形加油站环绕一圈到起点

There are N gas stations along a circular route, where the amount of gas at station i isgas[i].
You have a car with an unlimited gas tank and it costscost[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.

public class Solution {
   
    public int canCompleteCircuit(int[] gas, int[] cost) {
        if(gas==null||gas.length==0){