超级字符串

思路：排列出所有的可能，然后逐个寻找是否包含所有的字符串，取长度最短的。（很暴力）
编程语言：Python

#!/usr/bin/env python# -*- coding: UTF-8 -*-import itertoolsdata_raw=raw_input()# data_raw = "abc ab bc a"data = data_raw.split()tmp=''.join(data)result=len(tmp)for x in xrange(len(tmp)):    for i in itertools.permutations(tmp,x+1):        tmp2=''.join(i)        flag=False        for j in data:            if tmp2.find(j)!=-1:                flag=True            else:                flag=False                break        if flag:            result_tmp=len(tmp2)            if result_tmp<result:                result=result_tmpprint result

运行结果：

abc ab bc a3