yqf113的专栏

输入N个整数，寻找其中最小的k个数。方法1：利用Partition函数，找到位于第k-1坐标的数，则它左边的数以及它自己就是要返回的k个数。class Solution {public: void swap(int &fir, int &sec) { int temp = fir; fir = sec; sec = temp; } int getP...

给定一个二叉树，判断该二叉树是不是对称的。1.递归方法class Solution {public: bool isSymmetrical(TreeNode* pRoot) { return isSymmetrical(pRoot,pRoot); } bool isSymmetrical(TreeNode* pRoot1,TreeNode...

2.分行打印class Solution {public: vector<vector<int> > Print(TreeNode* pRoot) { vector<vector<int>> res; if (pRoot == nullptr) return res; deque<TreeNode*> d; ...

方法1：二分迭代法#include <cstdio>#include <iostream>#include <algorithm>#define eps 1e-8using namespace std;double n;double fun(double mid){return mid*mid*mid<n?1:0;}int m...