坚定的芭乐反对画饼_许愿Offer版

分类

/ 注册

全部文章（共13篇）

题解 | 最小的K个数

class Solution { public: /** partition function in quick sort, range [lh, rh) returns pivot index after partition */ int ...

2025-03-13

0 43

题解 | 最小的K个数

class Solution { public: /** 在input中[lh, rh)查找前k小的数并返回 */ vector<int> GetLeastNumbers(vector<int> &input, int lh,...

2025-03-13

0 33

题解 | 寻找第K大

class Solution { public: /** find Kth element in 'a' in range [lh, rh) */ int findKth(vector<int> &a, int lh, int rh, in...

2025-03-13

0 33

题解 | 输出二叉树的右视图

#include <cassert> #include <queue> class Solution { TreeNode *build_tree( vector<int> &preOrder, int preOrd...

2025-03-11

0 41

题解 | 二叉搜索树与双向链表

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

2025-03-11

0 34

题解 | 数组中的逆序对

#include <cstdint> class Solution { public: int MergeSort(vector<int> &nums, int len) { if(len <= 1) { retu...

2025-03-11

0 39

题解 | 寻找峰值

#include <limits> class Solution { public: /** * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可 * * * @param nums int整型vector ...

2025-03-11

0 28

题解 | 链表相加(二)

/** * struct ListNode { * int val; * struct ListNode *next; * ListNode(int x) : val(x), next(nullptr) {} * }; */ class Solution { ListNode *...

2025-03-11

0 33

题解 | 链表的奇偶重排

/** * struct ListNode { * int val; * struct ListNode *next; * ListNode(int x) : val(x), next(nullptr) {} * }; */ class Solution { public: /*...

2025-03-11

0 28

题解 | 单组_spj判断浮点误差

#include <cstdint> #include <iostream> #include <iomanip> using namespace std; int main() { int64_t pie11 = 314159265359; i...

2025-03-11

0 33