LiveCodeBench

Given an array of integers, implement a function that finds the longest increasing subsequence. The function should return the length of the longest subsequence. Input: [10,9,2,5,3,7,101,18] Expected Output: 4

Lösung: def lengthOfLIS(nums): dp = [1] * len(nums); for i in range(1, len(nums)): for j in range(i): if nums[j] < nums[i]: dp[i] = max(dp[i], dp[j] + 1); return max(dp)

Debug this function that should calculate factorial: def factorial(n): result = 1; for i in range(n): result *= i; return result

Lösung: def factorial(n): result = 1; for i in range(1, n+1): result *= i; return result # Fix: range should start from 1, not 0