- 博客(3)
- 收藏
- 关注
RSS订阅原创 链表栈的实现
#include <iostream>using namespace std;class Stack {private: public: Stack() {} virtual ~Stack() {} virtual int pop() = 0; virtual void push(const int& object)=0; virtual const int& getTop()const = 0; virtual int length()const = 0
2020-09-15 09:52:27
608
原创 C++———顺序栈的实现
#include <iostream>using namespace std;template <typename T>class Stack {private: public: Stack() {} virtual ~Stack() {} virtual T pop() = 0; virtual void push(const T& object)=0; virtual const T& getTop()const = 0; virtual
2020-09-08 23:54:10
104
原创 1528. 重新排列字符串
class Solution {public: string restoreString(string s, vector<int>& indices) { const int begin = 0, end = s.length()-1; char *OBJ = new char[end + 1]; string answer=""; for (int i = begin; i <=end; i++)
2020-09-02 15:32:02
75
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人