Leetcode55. Jumping game

Title transmission address : https://leetcode.cn/problems/jump-game/

The code is as follows :

 public static boolean canJump(int[] nums) {
    
        // Dealing with boundary conditions 
        if (nums.length == 1) {
    
            return true;
        }
        for (int i = 0; i < nums.length - 1; i++) {
    
            int j = i + 1;
            int nextStep = i; // Where to jump next 
            int farthest = 0; // Farthest 
            while (j < nums.length && j <= i + nums[i]) {
    
                if (j + nums[j] > farthest) {
    
                    farthest = j + nums[j];
                    nextStep = j;
                }
                j++;
            }
            if (farthest >= nums.length - 1) {
    
                return true;
            }
            if (nums[nextStep] == 0 && nextStep < nums.length - 1) {
    
                return false;
            }
            i = nextStep - 1;
        }
        return false;
    }