代码# Go packageleetcodefuncfindLengthOfLCIS(nums[]int)int{iflen(nums)==0{return0}res,length:=1,1fori:=1;i<len(nums);i++{ifnums[i]>nums[i-1]{length++}else{res=max(res,length)length=1}}returnmax(res,length)}funcmax(a,bint)int{ifa>b{returna}returnb}...
leetcode 521. Longest Uncommon Subsequence I Given a group of two strings, you need to find the longest uncommon subsequence of this group of two strings. The longest uncommon subsequence is defined as the longest subsequence of one of these strings and this subsequence should not beanysubsequence...
leetcode 521. Longest Uncommon Subsequence I Given a group of two strings, you need to find the longest uncommon subsequence of this group of two strings. The longest uncommon subsequence is defined as the longest subsequence of one of these strings and this subsequence should not beanysubsequence...