vector模糊查询

void CMy0713Dlg::OnBnClickedButton1()
{
    vecstduent stds;
    CString str;
    str.Format("张三");
    CStudent *pStd1 = new CStudent(str);
    str.Format("李四");
    CStudent *pStd2 = new CStudent(str);
    str.Format("王五");
    CStudent *pStd3 = new CStudent(str);
    
    stds.push_back(pStd1);
    stds.push_back(pStd2);
    stds.push_back(pStd3);
    int ans =  get_stds(stds,"张");

    
}

UINT CMy0713Dlg::get_stds(vecstduent &stds,char*k)
{
    int ans = 0;//符合k的个数
    CStudent* temp = NULL; // 用来交换的临时数
    //冒泡排序
    for (int i = 0; i < stds.size() -1 ; i++) 
    {
        for (int j = stds.size() - 1; j > i; j--) 
        {
            
            if (stds[j - 1]->m_strName > stds[j]->m_strName) 
            {
                temp = stds[j - 1];
                stds[j - 1] = stds[j];
                stds[j] = temp;
            }
        }
    }
    //二分搜索 返回k的第一个索引 复杂度O(log2n)
    auto it = stds.begin();
    int left = 0;
    int right = stds.size() -1  ;
    while(left < right)
    {
        int mid = (left + right) / 2;
        int i = 0;
        while(i < mid)
        {
            it ++;
            i++;
        }
        if((*it)->m_strName.Compare(k) >= 0)//比较字符串
        {
            right = mid;//缩进右边界
        }
        else
        {
            left = mid +  1;//缩进左边界
        }
        if(left >= right)//防止死循环
        {
            if((*it)->m_strName.Compare(k) < 0)
                it ++;
            break;
        }
        it = stds.begin();
    }



    //从索引开始遍历 直到不再符合条件
    for(;it != stds.end();)
    {
        CString cstr = (*it)->m_strName;
        if(cstr.Find(k) == 0)//如果包含
        {
            it = stds.erase(it);
            m_ShowInfo.AddString(cstr);
            ans ++;
        }
        else //如不包含 之后的全部舍弃
            break;
    }


    //显示列表
    for(auto it = stds.begin();it!=stds.end();it++)
    {
        m_ShowInfo.AddString((*it)->m_strName);
    }
    return ans;
}