力扣寒假刷题笔记（2）1.23

一、每日一题

 今天每日一题的思路很简单，基本不需要动脑子，STL运用熟练就没问题。一开始只用了一个map，存储{timestamp,price}，最小最大值不好整，调用min_element和max_element倒也是可以跑，就是会超时。

class StockPrice {
public:
    multiset<int> st;
    map<int,int> m;
    int cur;
    StockPrice() {
        cur=0;
    }
    
    void update(int timestamp, int price) {
        cur=max(cur,timestamp);
        if(m.count(timestamp)) 
        {
            auto pre=m[timestamp];
            auto mark=st.find(pre);
            st.erase(mark);
        }
        m[timestamp]=price;
        st.insert(price);
    }
    
    int current() {
        return m[cur];
    }
    
    int maximum() {
        return *st.rbegin();
    }
    
    int minimum() {
        return *st.begin();
    }
};

/**
 * Your StockPrice object will be instantiated and called as such:
 * StockPrice* obj = new StockPrice();
 * obj->update(timestamp,price);
 * int param_2 = obj->current();
 * int param_3 = obj->maximum();
 * int param_4 = obj->minimum();
 */

//超时代码
class StockPrice {
public:
    static bool cmp_value(const pair<int, int> left,const pair<int,int> right)
    {
        return left.second < right.second;
    }
    map<int,int> m;
    int cur;
    int mx=0;
    int mn=1e9;
    StockPrice() {
        cur=0;
    }
    
    void update(int timestamp, int price) {
        cur=max(cur,timestamp);
        if(!m.count(timestamp)) m.insert(pair<int, int>(timestamp, price));
        else 
        {
            m.erase(m.find(timestamp));
            m.insert(pair<int, int>(timestamp, price));
        }
    }
    
    int current() {
        return m[cur];
    }
    
    int maximum() {
        auto i= max_element(m.begin(),m.end(),cmp_value);
        return i->second;
    }
    
    int minimum() {
        auto i= min_element(m.begin(),m.end(),cmp_value);
        return i->second;
    }
};

/**
 * Your StockPrice object will be instantiated and called as such:
 * StockPrice* obj = new StockPrice();
 * obj->update(timestamp,price);
 * int param_2 = obj->current();
 * int param_3 = obj->maximum();
 * int param_4 = obj->minimum();
 */

二、DFS

class Solution {
public:
    vector<string> ans;
    string temp;
    vector<string>board={"","","abc","def","ghi","jkl","mno","pqrs","tuv","wxyz"};
    int len;
    void dfs(int p,string digits)
    {

        if(p==len) 
        {
            ans.push_back(temp);
            return;
        }
        int num=digits[p]-'0';
        for(int i=0;i<board[num].size();i++)
        {
            temp.push_back(board[num][i]);
            dfs(p+1,digits);
            temp.pop_back();
        }
    }
    vector<string> letterCombinations(string digits) {
        len=digits.size();
        if(len==0) return ans;
        dfs(0,digits);
        return ans;
    }
};