qq_40229767的博客

#pragma once#ifndef DSA_LIST_H#define DSA_LIST_H#define Posi(T) ListNode* //列表位置节点templatetypename T>struct ListNode//列表节点模板类实现{ T data;//数值 Posi(T)pred;//前驱

#pragma once#ifndef DSA_STACK_H#define DSA_STACK_Htemplatetypename T>class Stack //不需要继承！！！继承的话就不需要里面藏一个deque！！！{private: std::deque Q;public: int size() { return Q.size(); }//返回规模

bool isvalid(const vectorint>&p, int k){ for (int i = 0; i < k; i++) if (p[i] == p[k] ||abs( p[i] - p[k]) == abs(i - k)) return false; return true;}void rsolve(vectorint

#pragma once#define DEFAULT_CAPACITY 10templateclass Vector{private:int _capacity ; T*_elem; int _size;//容量默认为10，指向元素的指针，向量的规模public: Vector(int c=DEFAULT_CAPACITY) { _elem = new T[_capacity =

Given an array and a value, remove all instances of that value in-place and return the new length.Do not allocate extra space for another array, you must do this by modifying the input array in-plac