zoukankan      html  css  js  c++  java
  • leetcode341

    数据结构设计类题目,参考网上的代码:

    /**
     * // This is the interface that allows for creating nested lists.
     * // You should not implement it, or speculate about its implementation
     * class NestedInteger {
     *   public:
     *     // Return true if this NestedInteger holds a single integer, rather than a nested list.
     *     bool isInteger() const;
     *
     *     // Return the single integer that this NestedInteger holds, if it holds a single integer
     *     // The result is undefined if this NestedInteger holds a nested list
     *     int getInteger() const;
     *
     *     // Return the nested list that this NestedInteger holds, if it holds a nested list
     *     // The result is undefined if this NestedInteger holds a single integer
     *     const vector<NestedInteger> &getList() const;
     * };
     */
    class NestedIterator {
    public:
        NestedIterator(vector<NestedInteger> &nestedList) {
            begins.push(nestedList.begin());
            ends.push(nestedList.end());
        }
    
        int next() {
            return (begins.top()++)->getInteger();
        }
    
        bool hasNext() {
            while(begins.size())        
            {            
                if(begins.top() == ends.top())            
                {                
                    begins.pop();                
                    ends.pop();            
                }            
                else            
                {                
                    auto val = begins.top();                
                    if(val->isInteger()) 
                        return true;                
                    begins.top()++;                
                    begins.push(val->getList().begin());                
                    ends.push(val->getList().end());            
                }        
            }        
            return false;
    
        }
    
    private:
        stack<vector<NestedInteger>::iterator> begins, ends;
    };
    
    /**
     * Your NestedIterator object will be instantiated and called as such:
     * NestedIterator i(nestedList);
     * while (i.hasNext()) cout << i.next();
     */
  • 相关阅读:
    Linux系统安装IonCube的方法详解教程
    CentOS7 安装 odoo10
    关于WPF的弹出窗口
    WPF命令使用
    WPF访问UserControl的自定义属性和事件
    一步步实现 Prism + MEF(二)--- 绑定命令
    一步步实现 Prism + MEF(一)--- 搭建框架
    MVVM里绑定TreeView控件的SelectedItem
    MAF框架的使用限制
    排序--归并排序算法
  • 原文地址:https://www.cnblogs.com/asenyang/p/9739259.html
Copyright © 2011-2022 走看看