Find the length of the longest increasing subsequence in an array using dynamic programming.
Code
Algorithms$n = count($arr);
$dp = array_fill(0, $n, 1);
for ($i = 1; $i < $n; $i++) {
for ($j = 0; $j < $i; $j++) {
if ($arr[$i] > $arr[$j]) {
$dp[$i] = max($dp[$i], $dp[$j] + 1);
}
}
}
return max($dp);Parameters
Array of numbers
Server
More PHP Snippets
Array Difference
Find elements in the first array that are not present in the second array.
Array Frequencies
Count how many times each value appears in an array and return a frequency map.
Array Head
Get the first n elements of an array.
Array Intersection
Find common elements that exist in both arrays.
Array Tail
Get the last n elements of an array.
Array Union
Combine two arrays and remove duplicates to produce a union.