class Solution {
public:
int findString(vector<string>& words, string s) {
for(int i = 0; i < words.size(); i++)
{
if(words[i] == s)
{
return i;
}
}
return -1;
}
};
leetcode | 面试题 10.05. 稀疏数组搜索
最新推荐文章于 2021-09-08 12:39:38 发布