So two big alphabetic strings can be changed into two smaller teams.Second, match two teams (length and accumulation addition) and find matching partners.

• 第二步匹配两个（长度，累加和）数组，找出匹配项，第三步分别对数组中每一项所对应的字符串片段进行匹配。