I think...


  • 0
    W

    int flg=0;
    for(int i=0;i<nums.length-1;i++){
    if(nums[i]>nums[i+1]){
    flg=i+1;
    break;
    }
    }
    return nums[flg];


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.