更新周赛163临时文件

Author: blacksea3

cpp/leetcode/5263. shift-2d-grid.cpp

@@ -0,0 +1,31 @@
+#include "public.h"
+
+//
+//Ä£Äâ
+
+class Solution {
+public:
+	vector<vector<int>> shiftGrid(vector<vector<int>>& grid, int k) {
+		int maxr = grid.size();
+		int maxc = grid[0].size();
+		for (int i = 0; i < k; ++i)
+		{
+			vector<vector<int>> next(maxr, vector<int>(maxc, -9999));
+			for (int r = 0; r < maxr; ++r)
+			{
+				for (int c = 1; c < maxc; ++c)
+				{
+					next[r][c] = grid[r][c];
+				}
+			}
+			for (int r = 1; r < maxr; ++r)
+			{
+				next[r][0] = grid[r - 1][maxc - 1];
+			}
+			next[0][0] = grid[maxr - 1][maxc - 1];
+
+			grid = next;
+		}
+		return grid;
+	}
+};

cpp/leetcode/5264. find-elements-in-a-contaminated-binary-tree.cpp

@@ -0,0 +1,38 @@
+#include "BinaryTree.h"
+
+/**
+ * Definition for a binary tree node.
+ * struct TreeNode {
+ *     int val;
+ *     TreeNode *left;
+ *     TreeNode *right;
+ *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
+ * };
+ */
+class FindElements {
+private:
+	//±©Á¦,ת³Éunordered_set
+	unordered_set<int> us;
+	void recu(TreeNode* root, int prev)
+	{
+		if (!root) return;
+		us.insert(prev);
+		recu(root->left, 2 * prev + 1);
+		recu(root->right, 2 * prev + 2);
+	}
+
+public:
+	FindElements(TreeNode* root) {
+		recu(root, 0);
+	}
+
+	bool find(int target) {
+		return (us.find(target) != us.end());
+	}
+};
+
+/**
+ * Your FindElements object will be instantiated and called as such:
+ * FindElements* obj = new FindElements(root);
+ * bool param_1 = obj->find(target);
+ */

cpp/leetcode/5265. greatest-sum-divisible-by-three.cpp

@@ -0,0 +1,148 @@
+#include "public.h"
+
+//正数数组
+//分类, 搞清楚最长长度
+
+class Solution {
+public:
+	int maxSumDivThree(vector<int>& nums) {
+		multiset<int> ms0;
+		multiset<int> ms1;
+		multiset<int> ms2;
+
+		for (auto& n : nums)
+		{
+			if ((n % 3) == 0)
+			{
+				ms0.insert(n);
+			}
+			else if ((n % 3) == 1)
+			{
+				ms1.insert(n);
+			}
+			else
+			{
+				ms2.insert(n);
+			}
+		}
+
+		//数学题，暴力分类
+
+		int ms1mod3 = ms1.size() % 3;
+		int ms2mod3 = ms2.size() % 3;
+
+		int sum = accumulate(nums.begin(), nums.end(), 0);
+		int del = 0;
+
+		if (ms1mod3 == 0)
+		{
+			if (ms2mod3 == 0)
+			{
+				;
+			}
+			else if (ms2mod3 == 1)
+			{
+				//要么删掉ms2最小值, 要么删掉俩ms1最小值如果有的话
+				del = *ms2.begin();
+				if (ms1.size() >= 2)
+				{
+					int anodel = 0;
+					anodel = *ms1.begin();
+					ms1.erase(ms1.begin());
+					anodel += *ms1.begin();
+					del = min(del, anodel);
+				}
+			}
+			else //要么删掉俩ms2最小值, 要么删掉一ms1最小值如果有的话
+			{
+				del = *ms2.begin();
+				ms2.erase(ms2.begin());
+				del += *ms2.begin();
+				if (ms1.size() >= 1)
+				{
+					del = min(del, *ms1.begin());
+				}
+			}
+		}
+		else if (ms1mod3 == 1)
+		{
+			if (ms2mod3 == 0) //要么删掉ms1最小值, 要么删掉俩ms2最小值如果有的话
+			{
+				del = *ms1.begin();
+				if (ms2.size() >= 2)
+				{
+					int anodel = 0;
+					anodel = *ms2.begin();
+					ms2.erase(ms2.begin());
+					anodel += *ms2.begin();
+					del = min(del, anodel);
+				}
+			}
+			else if (ms2mod3 == 1)
+			{
+				; //ojbj
+			}
+			else //要么删掉俩ms1最小值如果有的话, 要么删掉一ms2最小值
+			{
+				del = *ms2.begin();
+				if (ms1.size() >= 2)
+				{
+					int anodel = 0;
+					anodel = *ms1.begin();
+					ms1.erase(ms1.begin());
+					anodel += *ms1.begin();
+					del = min(del, anodel);
+				}
+			}
+		}
+		else
+		{
+			if (ms2mod3 == 0) //要么删掉俩ms1最小值, 要么删掉一ms2最小值如果有的话
+			{
+				del = *ms1.begin();
+				ms1.erase(ms1.begin());
+				del += *ms1.begin();
+				if (ms2.size() >= 1)
+				{
+					del = min(del, *ms2.begin());
+				}
+			}
+			else if (ms2mod3 == 1)  //要么删掉一个ms1最小值，要么删掉两个ms2最小值如果有的话
+			{
+				del = *ms1.begin();
+				if (ms2.size() >= 2)
+				{
+					int anodel = 0;
+					anodel = *ms2.begin();
+					ms2.erase(ms2.begin());
+					anodel += *ms2.begin();
+					del = min(del, anodel);
+				}
+			}
+			else
+			{
+				; //ojbj
+			}
+		}
+
+		return sum - del;
+
+	}
+};
+
+/*
+int main()
+{
+	Solution* s = new Solution();
+	vector<int> nums00 = { 2,6,2,2,7 };
+	cout << s->maxSumDivThree(nums00) << endl;
+
+	vector<int> nums0 = { 3,6,5,1,8 };
+	cout << s->maxSumDivThree(nums0) << endl;
+	vector<int> nums1 = { 4 };
+	cout << s->maxSumDivThree(nums1) << endl;
+	vector<int> nums2 = { 1,2,3,4,4 };
+	cout << s->maxSumDivThree(nums2) << endl;
+	return 0;
+}
+*/