11 2020 档案

LC 1674. Minimum Moves to Make Array Complementary (差分)
摘要：link class Solution { public: int minMoves(vector<int>& nums, int limit) { int n=nums.size(); vector<int> diff(2*limit+2); for(int i=0;i<n/2;i++){ int 阅读全文
posted @ 2020-11-30 16:14 feibilun 阅读(100) 评论(0) 推荐(0)
LC 222. Count Complete Tree Nodes （二分查找）
摘要：link /** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NUL 阅读全文
posted @ 2020-11-24 09:02 feibilun 阅读(86) 评论(0) 推荐(0)
LC 5604. Maximize Grid Happiness
摘要：link class Solution { public: int memo[5][5][7][7][1<<10]; int getMaxGridHappiness(int m, int n, int introvertsCount, int extrovertsCount) { memset(me 阅读全文
posted @ 2020-11-16 09:36 feibilun 阅读(150) 评论(0) 推荐(0)
LC 1655. Distribute Repeating Integers (状压)
摘要：link class Solution { public: int n; int memo[50][1<<10]; bool canDistribute(vector<int>& nums, vector<int>& quantity) { vector<int> cnt(1001); n=quan 阅读全文
posted @ 2020-11-16 09:35 feibilun 阅读(136) 评论(0) 推荐(0)