chenuo20012

剑指offer题库

/ 注册

全部文章 / 剑指offer题库（共20篇）

数组中只出现一次的数字

class Solution {public: void FindNumsAppearOnce(vector<int> data,int* num1,int *num2) { int n = data.size(); int res; fo...

2020-03-24

0 481

把数组排成最小的数

include class Solution {public: string PrintMinNumber(vector<int> numbers) { string res = ""; sort(numbers.begin(), n...

2020-03-23

0 495

整数中出现1的个数

class Solution {public: int NumberOf1Between1AndN_Solution(int n) { int dev = 10; //除数 int multi = 1; int res = 0; ...

2020-03-22

0 490

数据流中的中位数

class Solution {public: void Insert(int num) { int n = min.size(); //最小堆的元素 int m = max.size(); //最大堆的元素 if (((n + m) &1...

2020-03-21

0 471

连续子数组的最大和

class Solution {public: int FindGreatestSumOfSubArray(vector<int> array) { int n = array.size(); if(0 == n) return 0...

2020-03-21

0 382

数组中超过一半的数字

class Solution {public: int MoreThanHalfNum_Solution(vector<int> numbers) { int res; int n = numbers.size(); if(0 == n) ...

2020-03-20

0 475

字符串的排列

include class Solution {public: vector<string> Permutation(string str) { vector<string>res; int n = str.length(); ...

2020-03-19

0 393

序列化二叉树

class Solution {public: char* Serialize(TreeNode *root) { if (!root) return nullptr; string resStr; //存放结果 serializ...

2020-03-18

0 436

二叉搜索树与双向链表

class Solution {public: TreeNode* Convert(TreeNode* pRootOfTree) { if(!pRootOfTree) return nullptr; TreeNode* lastNode ...

2020-03-18

0 444

复杂链表的复制

class Solution {public: //此题分为 3 个步骤来对链表进行操作 RandomListNode* Clone(RandomListNode* pHead) { if(!pHead) return nullptr; ...

2020-03-18

0 452