Vulkan

摘要： // Write a program to sort a stack in ascending order. You should not make any assumptions about how the stack is implemented. The following are the o... 阅读全文

摘要： //Implement a MyQueue class which implements a queue using two stacks.#include #includeusing namespace std;class MyQueue{public: stack data,buffer; My... 阅读全文

摘要： 暂存 阅读全文

摘要： //Imagine a (literal) stack of plates. If the stack gets too high, it might topple. Therefore, in real life, we would likely start a new stack when th... 阅读全文

摘要： //How would you design a stack which, in addition to push and pop, also has a function min which returns the minimum element? Push, pop and min should... 阅读全文

摘要： 这题的思想来自于http://hawstein.com/posts/2.5.html，重新实现了一下用hash来记录循环的起点//Given a circular linked list, implement an algorithm which returns node at the beginn... 阅读全文

摘要： 删除前面的linklist，使用node来表示链表// You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in rever... 阅读全文

摘要： #include #include using namespace std;class linklist{private: class node { public: node(){} string data; node * next; }; int size;public: node *he... 阅读全文

摘要： #include #include using namespace std;class linklist{private: class node { public: node(){} string data; node * next; }; node *head; int size;publi... 阅读全文

摘要： 暂存 阅读全文