实验代码

最新推荐文章于 2024-04-14 21:35:15 发布

soft_w

最新推荐文章于 2024-04-14 21:35:15 发布

阅读量218

点赞数

本文链接：https://blog.csdn.net/soft_w/article/details/6438511

版权

#include <iostream>

#include <cstdlib>

#include <algorithm>

#include <string>

#include <vector>

#include <map>

using namespace std;

void strToVec_int(const string &str,vector<int> &vi)

{

string::size_type b = 0,e = str.find("|");

while(e != string::npos)

{

vi.push_back(atoi(str.substr(b,e).c_str()));

b = e + 1;

e = str.find("|",b);

}

vi.push_back(atoi(str.substr(b).c_str()));

}

struct userData

{

string m_strHuntingNum; //号码

string m_strLastTime; //最晚挂机时间

void initialize(string &s1,string &s2)

{

m_strHuntingNum = s1;

m_strLastTime = s2;

}

};

bool sort_vec(const userData &us1,const userData &us2)

{

return us1.m_strLastTime < us2.m_strLastTime;

}

struct tab1

{

int m_iHuntingList;

int m_iHuntingType;

string m_strHuntingSeq;

};

struct tab2

{

int m_iHuntingList;

int m_iGLFlag;

int m_iHuntingNumID;

string m_strHuntingNum;

string m_strLastAnswerTime;;

string m_strLastHunpUpTime;

void initialize(int i,int j,int id,const string &n,const string &ml ,const string &mh)

{

m_iHuntingList = i;

m_iGLFlag = j;

m_iHuntingNumID = id;

m_strHuntingNum = n;

m_strLastAnswerTime = ml;

m_strLastHunpUpTime = mh;

}

};

struct tab3

{

int m_iHuntingList;

int m_iGLHuntingListID;

string m_strGLHungingSeq;

void initialize(int i,int j,const string &s)

{

m_iHuntingList = i;

m_iGLHuntingListID = j;

m_strGLHungingSeq = s;

}

};

struct tab4

{

int m_iHuntingList;

int m_iGLHuntingListID;

int m_iGLHuntListNumID;

string m_strHuntingNum;

string m_strLastAnswerTime;

string m_strLastHunpUpTime;

void initialize(int i,int j,int k,const string &s1,const string &s2,const string &s3)

{

m_iHuntingList = i;

m_iGLHuntingListID = j;

m_iGLHuntListNumID = k;

m_strHuntingNum = s1;

m_strLastAnswerTime = s2;

m_strLastHunpUpTime = s3;

}

};

int main(void)

{

puts("Program Start...");

tab1 t_oTb1;

vector<int> t_vecHuntingList;

{//tab1数据先按最后应答时间排序（type = 1）

t_oTb1.m_iHuntingList = 1;

t_oTb1.m_iHuntingType = 0; //假设是按最后应答时间排序

t_oTb1.m_strHuntingSeq = "6|7|3|1|9|0";

strToVec_int(t_oTb1.m_strHuntingSeq,t_vecHuntingList);

}

vector<tab2> t_vecTab2;

map<int,int> t_mapGLListSeq;

map<int,vector<userData> > t_mapSeqNum;

userData t_oUserData;

{//tab2数据 vector<tab2>

tab2 tmp_oTab2;

tmp_oTab2.initialize(1,0/*flag*/,0/*seq*/,"000"/*num --GLHuntingListID*/,"1200","1900");

t_vecTab2.push_back(tmp_oTab2);

tmp_oTab2.initialize(1,1/*flag*/,6/*seq*/,"8"/*num*/,"1200","1900"); //需要查第三张表

t_vecTab2.push_back(tmp_oTab2);

tmp_oTab2.initialize(1,1/*flag*/,1/*seq*/,"1"/*num*/,"1200","1900"); //需要查第三张表

t_vecTab2.push_back(tmp_oTab2);

tmp_oTab2.initialize(1,0/*flag*/,7/*seq*/,"777"/*num*/,"1700","1500");

t_vecTab2.push_back(tmp_oTab2);

tmp_oTab2.initialize(1,1/*flag*/,3/*seq*/,"9"/*num*/,"1200","1900"); //需要查第三张表

t_vecTab2.push_back(tmp_oTab2);

tmp_oTab2.initialize(1,1/*flag*/,9/*seq*/,"10"/*num*/,"1200","1900"); //需要查第三张表

t_vecTab2.push_back(tmp_oTab2);

for(vector<tab2>::iterator it = t_vecTab2.begin(); it != t_vecTab2.end(); ++it)

{

if(it->m_iGLFlag == 1)

{

t_mapGLListSeq[atoi(it->m_strHuntingNum.c_str())] = it->m_iHuntingNumID;

}

else

{

t_oUserData.initialize(it->m_strHuntingNum,it->m_strLastAnswerTime);

if(t_oTb1.m_iHuntingType == 2 || t_oTb1.m_iHuntingType == 3) //按最晚时间或者同振

{

t_mapSeqNum[0].push_back(t_oUserData);

}

else

{

t_mapSeqNum[it->m_iHuntingNumID].push_back(t_oUserData);

}

vector<tab3> t_vecTab3; //第三张表数据

{//tab3数据 vector<tab3>

tab3 tmp_oTab3;

tmp_oTab3.initialize(1,10,"2|7|9");

t_vecTab3.push_back(tmp_oTab3);

tmp_oTab3.initialize(1,1,"3|5|8");

t_vecTab3.push_back(tmp_oTab3);

tmp_oTab3.initialize(1,9,"1|8|9");

t_vecTab3.push_back(tmp_oTab3);

tmp_oTab3.initialize(1,8,"2|7|9");

t_vecTab3.push_back(tmp_oTab3);

}

vector<tab4> t_vecTab4; //第四张表数据

{

tab4 tmp_oTab4;

tmp_oTab4.initialize(1,10,9,"911","1200","1300");