给出一个列表，找出连续k个string得出的最长字符串

PythonCwk

You are given an array strarr of strings and an integer k. Your task is to return the first longest string consisting of k consecutive strings taken in the array.

#Example: longest_consec(["zone", "abigail", "theta", "form", "libe", "zas", "theta", "abigail"], 2) --> "abigailtheta"

n being the length of the string array, if n = 0 or k > n or k <= 0 return "".

题意为给出一个列表，找出连续k个string得出的最长字符串

用例与结果如下：
["zone", "abigail", "theta", "form", "libe", "zas"], 2, "abigailtheta"
["ejjjjmmtthh", "zxxuueeg", "aanlljrrrxx", "dqqqaaabbb", "oocccffuucccjjjkkkjyyyeehh"], 1, "oocccffuucccjjjkkkjyyyeehh")
[], 3, ""
["itvayloxrp","wkppqsztdkmvcuwvereiupccauycnjutlv","vweqilsfytihvrzlaodfixoyxvyuyvgpck"], 2, "wkppqsztdkmvcuwvereiupccauycnjutlvvweqilsfytihvrzlaodfixoyxvyuyvgpck"
["wlwsasphmxx","owiaxujylentrklctozmymu","wpgozvxxiu"], 2, "wlwsasphmxxowiaxujylentrklctozmymu"
["zone", "abigail", "theta", "form", "libe", "zas"], -2, ""
["it","wkppv","ixoyx", "3452", "zzzzzzzzzzzz"], 3, "ixoyx3452zzzzzzzzzzzz"
["it","wkppv","ixoyx", "3452", "zzzzzzzzzzzz"], 15, ""

PythonCwk

def longest_consec(strarr, k):
    length = len(strarr)
    count_set = dict()
    if length == 0 or k > length or k <= 0:
        return ''
    else:
        for i in range(length-k+1):
             count_set[i] = ''.join(strarr[i:i+k])

    temp = [(len(count_set[i]), i) for i in count_set]
    long_index = max(temp)
    result = count_set[long_index[1]]
    return result

#我写这个没有过去

ABC23

Sunday算法、KMP算法、BF算法……