漫无止境

分类

题解(4)

/ 注册

全部文章（共4篇）

用字典法确定重复个数

class Solution {public: ListNode* deleteDuplication(ListNode* pHead) {if (!pHead) return nullptr; vector<ListNode*> v; while...

2020-07-04

0 422

字符流中第一个不重复的字符，很简单

string a;public: //Insert one char from stringstream void Insert(char ch) { a.push_back(ch); } //return the first appearence once char...

2020-06-16

0 341

啊哈哈哈，挺简单的

class Solution {public:vectora;void Insert(int num){a.insert(a.begin(),num);} double GetMedian() { sort (a.begin(),a.end()); if(a.size()%2==1) ...

2020-06-15

0 458

迭代

class Solution {public: int jumpFloorII(int number) { int a=0; if(number==1||number==0) return 1;for(int i=1;i<=number;...

2020-06-14

0 327