李顺利plus

分类

题解(15)

/ 注册

全部文章（共90篇）

题解 | #把数组排成最小的数#

class Solution { public: string PrintMinNumber(vector<int> numbers) { vector<string>res; for(auto & x : numbers) res.p...

2022-12-27

0 224

题解 | #数字在升序数组中出现的次数#

class Solution { public: int find(vector<int> res, float a){ int head = 0 , tail = res.size() - 1; int mid = ( tail + head ...

2022-12-27

0 233

题解 | #对称的二叉树#

class Solution { public: bool ismirror(TreeNode* p1,TreeNode* p2){ if(p1==NULL&&p2==NULL) return true; if(p1==NULL&&p2!=NULL) r...

2022-12-27

0 298

题解 | #数值的整数次方#

class Solution { public: double Power(double base, int exponent) { if(exponent<0){ base=1/base; exponent=-expon...

2022-12-18

0 206

题解 | #滑动窗口的最大值#

class Solution { public: vector<int> maxInWindows(const vector<int>& num, unsigned int size) { if(size>num.size()) retu...

2022-12-16

0 200

题解 | #矩形覆盖#

class Solution { public: int rectCover(int number) { int old=1,last=2,now; if(number==0) return 0; if(number==1) return 1;...

2022-12-15

0 187

题解 | #扑克牌顺子#

class Solution {public: bool IsContinuous( vector<int> numbers ) { &n...

2022-12-12

0 228

题解 | #扑克牌顺子#

class Solution {public: bool IsContinuous( vector<int> numbers ) { &n...

2022-12-12

0 215

题解 | #剪绳子#

class Solution {public: int cutRope(int number) { //进行数...

2022-12-12

0 259

题解 | #栈的压入、弹出序列#

class Solution {public: bool IsPopOrder(vector<int> pushV,vector<int> popV) { &n...

2022-11-25

0 225