LeetCode1268 搜索推荐系统

/*
 * @lc app=leetcode.cn id=1268 lang=cpp
 *
 * [1268] 搜索推荐系统
 * 推荐 products 数组中前缀与 searchWord 相同的最多三个产品(注意是相同，不是相同的字母最多！！！)
 */

// @lc code=start
#include<iostream>
#include<vector>
#include<string>
#include<map>
#include<algorithm>
using namespace std;
class Solution {
public:
/*暴力解法，采用顺序查找
    vector<vector<string>> suggestedProducts(vector<string>& products, string searchWord) {
        vector<vector<string>> res;
        sort(products.begin(),products.end());
        string pre="";
        for(int i=0;i<=searchWord.size()-1;i++){
            pre+=searchWord[i];
            int count=0;
            vector<string> list;
            for(int j=0;j<products.size();j++){
                if(products[j].find(pre)==0){
                    list.emplace_back(products[j]);
                    count++;
                }
                if(count==3){
                    break;
                }
            }
            res.emplace_back(list);
        }
        return res;
    }
*/
//二分查找，找出最小的字典序大于等于 prefix 的字符串 products[i]
    vector<vector<string>> suggestedProducts(vector<string>& products, string searchWord) {
        vector<vector<string>> res;
        sort(products.begin(),products.end());
        string pre="";
        auto left=products.begin();
        for(int i=0;i<searchWord.size();i++){
            pre+=searchWord[i];
            left=lower_bound(left,products.end(),pre);
            vector<string> list;
            for(int j=0;j<3;j++){
                if(left+j<products.end()&&(*(left+j)).find(pre)==0){
                    list.push_back(*(left+j));
                }
            }
            res.push_back(list);
            //left=location;
        }
        return res;
    }
};
// @lc code=end

int main(){
    vector<string> ps={"mobile","mouse","moneypot","monitor","mousepad"};
    sort(ps.begin(),ps.end());
    auto it=ps.begin();
    cout<<*it<<endl;
    for(int i=0;i<ps.size();i++){
        cout<<ps[i]<<" ";
    }
    cout<<endl;
    vector<int> nums={1,3,4,7,11,13,14,16};
    int target;
    cin>>target;
    int loc=lower_bound(nums.begin(),nums.end(),target)-nums.begin();
    //if(nums[loc]==target){
    cout<<loc<<endl;    
    //}
    //cout<<-1<<endl;
    return 0;
}