sankuaizhuobu的博客

我看的代码https://leetcode-cn.com/problems/island-perimeter/comments/43681官方题解https://leetcode-cn.com/problems/island-perimeter/solution/dao-yu-de-zhou-chang-by-leetcode-solution/class Solution {public: int islandPerimeter(vector<vector<int&...

结论是m为中位数，简单证明：https://leetcode-cn.com/problems/minimum-moves-to-equal-array-elements-ii/comments/97616class Solution {public: int minMoves2(vector<int>& nums) { sort(nums.begin(),nums.end()); int n=nums.size(); i..

题解https://leetcode-cn.com/problems/er94lq/solution/mo-ni-xi-pai-guo-cheng-xiang-xi-fen-xi-li-jie-kde-/主要就是分析出：k如果存在，则是唯一的。注意点：1）vector取走前k个元素：vector a(first.begin()+k,first.end())；2）取偶数和奇数，取偶数位置和奇数位置：i+=2；3）如何迭代洗牌，用两个vector交替。class Solution ..

关于if(k==i*n+j*n-i*j) re+=C(n,i)*C(n,j);在n行中选i个，在n列中选j个class Solution {public: int paintingPlan(int n, int k) { if(k==n*n||k==0) return 1; if(k<n) return 0; int i,j,re=0; for(i=0;i<n;+...