guokaide / algorithm Goto Github PK

        if (curDiff > maxDiff) {
            maxDiff = curDiff;
        }

        if (prices[i] < minPrice) {
            minPrice = prices[i];
        }
    }`

    int min = array[0];
    int profit = array[1] - array[0];
    for(int i = 2; i < array.length; i++){
        if(array[i-1]<min){
            min = array[i-1];
        }
        if(array[i] - min > profit){
            profit = array[i] - min;
        }
    }
    
    return profit;
}`

    //先让前面的指针走K步，然后在一起走，前面的指针走到最后，后面的指针指向倒数第K个节点
    while(length > 1 && node2 != null)
    {
        node2 = node2.next;
        length--;
    }
            
    if(length > 1 || node2 == null)
    {
        return null;
    }`