leetcode1797. 设计一个验证系统
定义如下两个STL容器
class NodeL
{
public:
int expire;
string token;
public:
NodeL()
{
}
NodeL(string s, int time)
{
expire = time;
token = s;
}
};
list<NodeL*> ls;
map<string, list<NodeL*>::iterator> mp;
给ls容器和mp容器添加成员
NodeL* mynode = new NodeL(tokenId, currentTime + ttl);
ls.push_back(mynode);
mp[tokenId] = ls.end()--;
这时,想通过mp访问mynode中的expire,需要考虑(->)和(*)的优先级问题
(*ls.begin())->expire;//正确
*ls.begin()->expire;
*(ls.begin())->expire;
(*mp[tokenId])->expire;//正确
*mp[tokenId]->expire;
*(mp[tokenId])->expire;