g0001_0100.s0055_jump_game.Solution.swift Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-all Show documentation

104 LeetCode algorithm problem solutions

There is a newer version: 1.8

// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Dynamic_Programming #Greedy
// #Algorithm_II_Day_12_Dynamic_Programming #Dynamic_Programming_I_Day_4 #Udemy_Arrays
// #Big_O_Time_O(n)_Space_O(1) #2024_06_23_Time_132_ms_(89.47%)_Space_15.5_MB_(85.96%)

public class Solution {
    public func canJump(_ nums: [Int]) -> Bool {
        let sz = nums.count
        var tmp = 1
        for i in 0..= sz - 1 {
                return true
            }
        }
        return true
    }
}