xiongqiangcs

题解

/ 注册

全部文章 / 题解（共23篇）

c++

class Solution { public: int LastRemaining_Solution(int n, int m) { if (m <=0 || n <= 0) return -1; queue<int> que...

2020-04-27

0 725

c++

/* struct TreeNode { int val; struct TreeNode *left; struct TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(N...

2020-04-27

0 506

c++

class Solution { public: TreeNode* KthNode(TreeNode* pRoot, int k) { if (pRoot == NULL || k == 0) return NULL; stack<TreeNo...

2020-04-26

0 547

c++

class Solution { public: void Insert(int num) { int cnt = heap1.size()+heap2.size(); if (cnt&1) { heap2.push(n...

2020-04-26

0 508

c++

class Solution { public: int cutRope(int number) { if (number < 2) return 0; if (number == 2) return 1; if (number == 3...

2020-04-26

0 517

c++

class Solution { public: bool dfs(char* matrix, int row, int col, int rows, int cols, char* str, int len, vector<vector<bool> >& ...

2020-04-26

0 528

c++

class Solution { public: int getDigitSum(int number) { int sum = 0; while(number) { sum+=number%10; number...

2020-04-26

0 472

c++

class Solution { public: vector<int> multiply(const vector<int>& A) { if (A.size() < 1) return A; vector<int...

2020-04-23

0 445

c++

class Solution { public: // Parameters: // numbers: an array of integers // length: the length of array numbers ...

2020-04-23

0 441

c++

class Solution { public: int MoreThanHalfNum_Solution(vector<int> numbers) { int cnt = 0, num = 0; for (size_t i = 0; i <...

2020-04-23

1 605