这场比赛基本上没什么难度,几个水题,最难得的题基本上就是一个入门dp
A
暴力匹配字符串,一共四层循环暴力跑
class Solution {
public:
vector<string> stringMatching(vector<string>& words) {
string matchingString;
string patternString;
vector<string> stringMatching;
for(int i=0 ;i<words.size();i++)//100*100*30*30
{
matchingString = words[i];
int flag = 0 ;
for(int j = 0 ;j< words.size();j++)
{
patternString =words[j];
if(i == j ) continue;
for(int k = 0 ; k <patternString.size() ; k++)
{
for (int l = 0 ; l<matchingString.size()&&k+l<patternString.size(); l++)
{
if(matchingString[l] != patternString[k+l] ) break;