字符串处理：求最大递增字串长度

2019/04/04

老程序狗经常遇到的面试问题，23333333。dp字符串处理：求最大递增字串长度。。mark。半路出家，半路忘。。

python版

# coding: utf-8

# dp字符串处理：求最大递增字串长度
def maxIncreStrLen(array):
    len_nums = len(array)
    if len_nums == 0:
        return 0

    dp = [1] * len_nums
    for i in range(len_nums - 1):
        for j in range(i + 1):
            # 如果array[i+1]能缀在array[j]后面的话，就array[j]+1
            if array[i + 1] &gt; array[j]:
                # 缀完的结果还要看看是不是比我大
                dp[i + 1] = max(dp[i + 1], dp[j] + 1)
                print(dp)
    return max(dp)


if __name__ == "__main__":
    array = [1,3,6,2,3,1,2,3,4,5,6,7,8,9,1,2,8]
    print(maxIncreStrLen(array))

# coding: utf-8

# dp字符串处理：求最大递增字串长度

def maxIncreStrLen(array):

len_nums = len(array)

if len_nums == 0:

return 0

dp = [1] * len_nums

for i in range(len_nums - 1):

for j in range(i + 1):

# 如果array[i+1]能缀在array[j]后面的话，就array[j]+1

if array[i + 1] > array[j]:

# 缀完的结果还要看看是不是比我大

dp[i + 1] = max(dp[i + 1], dp[j] + 1)

print(dp)

return max(dp)

if __name__ == "__main__":

array = [1,3,6,2,3,1,2,3,4,5,6,7,8,9,1,2,8]

print(maxIncreStrLen(array))

Blogroll