实现的代码如下：
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131#in...
实现的代码如下：
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081#include<iostream>#include<cmath>#include<cstring>#include<cstdlib>#include"ArraY.h"using namespace s...
isValid-链接
实现的代码如下：
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281...
基于ArraY此数组实现的——栈
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152#include<iostream>#include<cmath>#include<cstdlib>#include<cstring>#include"ArraY.h"using namespace std;template<typename T>class ArrayStack...
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134//栈...
uniqueMorseRepresentations-链接
实现的代码如下：
1234567891011121314151617181920212223242526272829303132333435363738#include<iostream>#include<set>#include<cstdlib>#include<vector>#include<cstring>using namespace std;class Solution {public: int uniqueMorseRepresentatio...
rob-链接
实现的代码如下：
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110#include<iostream>#include<set>#include<vect...
House Robber-链接
实现的代码如下：
12345678910111213141516171819202122232425262728293031323334353637383940414243#include<iostream>#include<vector>#include<cmath>using namespace std;class Solution {public: int MAX(vector<int>&arr,int n) { int max=arr[0]; ...
maxProfi-链接
实现的代码如下：
123456789101112class Solution {public: int maxProfit(vector<int>& prices) { int sum=0; for(int i=0;i<prices.size();i++) { if(i+1<prices.size()&&prices[i+1]>prices[i]) sum+=...
maxProfit-链接
实现的代码如下：
12345678910111213141516171819202122232425262728#include<iostream>#include<vector>#include<cmath>using namespace std;class Solution {public: int maxProfit(vector<int>& prices) { int ans=0; for(int i=0;i<prices.size();i...
