leetcode-Longest Increasing Subsequence

leetcode第300题：典型的动态规划。
思考：开始想了很久还是没找出状态转移方程。从百度找找了大佬们的解法。最后自己改了改再pass。
代码：
class Solution {
public int lengthOfLIS(int[] nums) {
if(nums.length==0){
return 0;
}
int arr[]=new int[nums.length];
int result=1;
for(int i=0;i<arr.length;i++){
arr[i]=1;
for(int j=0;j<i;j++){
if(nums[j]<nums[i]){
arr[i]=Math.max(arr[i],arr[j]+1);
result=Math.max(arr[i],result);
}
}
}
return result;
}
}
Runtime: 13 ms, faster than 43.67% of Java online submissions for Longest Increasing Subsequence.Memory Usage: 37.9 MB, less than 16.01% of Java online submissions for Longest Increasing Subsequence.Next challenges