The shortest common superstring problem(SCS) is to find the shortest possible string that contains every string in a given set as substrings.

• 最短公共超串问题就是对给定的子串集合找到包含每个子串的可能的串。