这几年美国两院基本没做啥有用的立法# EB23 - 劳工卡
a*8
1 楼
给两个String, s1和s2,找s1的尾部和s2的头部的最长match
Example:
s1: "1234", s2: "3451", result: "34"
s1: "12", s2: "123", result: "12"
If s1.length() == m and s2.length() == n,
k = Math.min(m, n), can you find a solution better than O(k^2)?
Example:
s1: "1234", s2: "3451", result: "34"
s1: "12", s2: "123", result: "12"
If s1.length() == m and s2.length() == n,
k = Math.min(m, n), can you find a solution better than O(k^2)?