Find the match which has the longest match for the first sub-expression, along with any ties. If there is only one such match then return it.
在各种情况下,寻找匹配第一个子表达式最长的匹配。如果只有一个这样的匹配,就返回它。
It was the toughest first-round match we've ever played and possibly the longest in terms of time.
这是我们打过的最艰辛的首轮比赛了,MS还是时间最长的。
应用推荐