[一起来刷leetcode吧][7]--No.673 Number of Longest Increasing Subsequence

这篇文章是程序自动发表的,详情可以见 这里
href="http://ounix1xcw.bkt.clouddn.com/github.markdown.css" rel="stylesheet">

这是leetcode的第673题--Number of Longest Increasing Subsequence

  题目 Given an unsorted array of integers, find the number of longest increasing subsequence. Input: [2,2,2,2,2] Output: 5   思路 找最长子序列dp很好找，但是要求数目的话，还需要对最长序列的第几个字符进行一次dp，这里编程实现还是有点麻烦，要考虑相同的字符 如果相同的subsequence不计，只需将31，32两行改为dics[t 1][i]=ct   总结 做了近两个月的题，我好菜呀   

show me the code

class Solution(object):
    def findNumberOfLIS(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        if not nums:return 0
        maxval,minval,n=nums[0],nums[0],0
        for i in nums:
            if i>maxval:maxval = i
            if i<minval:minval=i
            n =1
        if maxval==minval:return n

        dics=[{-1<<30:1}]
        mn=[-1<<30]
        lv=1
        for i in nums:
            for j in  range(lv):
                t = lv-1-j
                if i>mn[t]:
                    ct=0
                    for k in dics[t]:
                        if i>k:ct =dics[t][k]
                    if t 1==lv:  # t 1 out of range, append
                        mn.append(i)
                        dics.append({i:ct})
                        lv =1
                    else:
                        mn[t 1] = min(i,mn[t 1])
                        if i in dics[t 1]:dics[t 1][i] =ct
                        else:dics[t 1][i]=ct
                    break
            #print(dics,mn)
        return sum(dics[-1].values())