给定一个数组s 其长度为l, 另有一个数组dp dp[i]表示 以i元素为结尾的最长上升子数组的数组长度，则下列选项中对求得数组dp方法正确的是
for (int i = 1; i < nums.length; i++) {dp[i] = 1;for (int j = 0; j < i; j++) { if (nums[i] > nums[j]) {dp[i] = Math.max(dp[i], dp[j] + 1);}}}
for (int i = 1; i < nums.length; i++) {dp[i] = 0;for (int j = 0; j < i; j++) {if (nums[i] > nums[j]) {dp[i] = Math.max(dp[i], dp[j] + 1);}}}
for (int i = 1; i < nums.length; i++) {dp[i] = 1;for (int j = 0; j < i; j++) {if (nums[i] > nums[j]) {dp[i] = Math.max(dp[i], dp[j])+1;}}}
for (int i = 1; i < nums.length; i++) {dp[i] = 0;for (int j = 0; j < i; j++) {if (nums[i] > nums[j]) {dp[i] = Math.max(dp[i], dp[j])+1;}}}
