update 双周赛12 临时文件

Author: blacksea3

cpp/leetcode/5096. array-transformation.cpp

@@ -0,0 +1,31 @@
+#include "public.h"
+
+//
+//±©Á¦Ñݱä
+
+class Solution {
+public:
+	vector<int> transformArray(vector<int>& arr) {
+		while (true)
+		{
+			vector<int> temp = arr;
+			temp[0] = arr[0];
+			for (int i = 1; i < arr.size() - 1; ++i)
+			{
+				if ((arr[i] > arr[i - 1]) && (arr[i] > arr[i + 1]))
+				{
+					temp[i] = arr[i] - 1;
+				}
+				else if ((arr[i] < arr[i - 1]) && (arr[i] < arr[i + 1]))
+				{
+					temp[i] = arr[i] + 1;
+				}
+				else temp[i] = arr[i];
+			}
+			temp[arr.size() - 1] = arr[arr.size() - 1];
+			if (temp == arr) break;
+			else arr = temp;
+		}
+		return arr; //dump
+	}
+};

cpp/leetcode/5097. design-a-leaderboard.cpp

@@ -0,0 +1,63 @@
+#include "public.h"
+
+//
+//±©Á¦
+
+class Leaderboard {
+private:
+	unordered_map<int, int> um;
+	multiset<int, greater<int>> ms;
+
+public:
+	Leaderboard() {
+		;
+	}
+
+	void addScore(int playerId, int score) {
+		if (um.find(playerId) == um.end())
+		{
+			um[playerId] = score;
+			ms.insert(score);
+		}
+		else
+		{
+			ms.erase(ms.find(um[playerId]));
+			um[playerId] += score;
+			ms.insert(um[playerId]);
+		}
+	}
+
+	int top(int K) {
+		int res = 0;
+		multiset<int, greater<int>>::iterator iter = ms.begin();
+		for (int i = 0; i < K; ++i)
+		{
+			res += *(iter);
+			iter++;
+		}
+		return res;
+	}
+
+	void reset(int playerId) {
+		ms.erase(ms.find(um[playerId]));
+		um.erase(playerId);
+	}
+};
+
+/**
+ * Your Leaderboard object will be instantiated and called as such:
+ * Leaderboard* obj = new Leaderboard();
+ * obj->addScore(playerId,score);
+ * int param_2 = obj->top(K);
+ * obj->reset(playerId);
+ */
+
+/*
+int main()
+{
+	Leaderboard* obj = new Leaderboard();
+	obj->addScore(1, 73);
+	cout << obj->top(1) << endl;
+	obj->reset(1);
+}
+*/

cpp/leetcode/5098. tree-diameter.cpp

@@ -0,0 +1,75 @@
+#include "public.h"
+
+//
+//拓扑排序, BFS
+
+class Solution {
+public:
+	int treeDiameter(vector<vector<int>>& edges) {
+		if (edges.empty()) return 0;
+
+
+		int numEdges = edges.size();
+		//拓扑排序
+		struct Node { int indegree = 0; unordered_set<int> nexts = {}; };  //包含入度以及下一节点,值就是vector的下标
+
+		//init
+		queue<int> q;
+		vector<Node> courses(numEdges + 1, Node());
+
+		for (auto& edge : edges)
+		{
+			courses[edge[1]].nexts.insert(edge[0]);
+			courses[edge[0]].indegree++;
+			courses[edge[0]].nexts.insert(edge[1]);
+			courses[edge[1]].indegree++;
+		}
+		for (int i = 0; i <= numEdges; i++)
+			if (courses[i].indegree == 1) q.push(i);
+
+		int time = 0;
+
+		//拆分节点
+		while (!q.empty())
+		{
+			if (q.size() == 1) return 2 * time;
+			else
+			{
+				queue<int> next;
+				time++;
+				while (!q.empty())
+				{
+					int prenodeid = q.front();
+					q.pop();
+					if (!courses[prenodeid].nexts.empty())
+					{
+						int nei = *courses[prenodeid].nexts.begin();
+						--courses[nei].indegree;
+						courses[nei].nexts.erase(prenodeid);
+						if (courses[nei].indegree == 1) next.push(nei);
+					}
+				}
+				q = next;
+			}
+		}
+
+		return 2 * time - 1;
+	}
+};
+
+/*
+int main()
+{
+	Solution* s = new Solution();
+	vector<vector<int>> edges0 = { {0, 1}, { 1,2 }, { 0,3 }, { 3,4 }, { 2,5 }, { 3,6 } };
+	cout << s->treeDiameter(edges0) << endl;
+	
+
+	vector<vector<int>> edges = { {0,1},{0,2} };
+	cout << s->treeDiameter(edges) << endl;
+
+	vector<vector<int>> edges2 = { {0,1},{1,2},{2,3},{1,4},{4,5} };
+	cout << s->treeDiameter(edges2) << endl;
+	return 0;
+}
+*/

cpp/leetcode/5115. palindrome-removal.cpp

@@ -0,0 +1,59 @@
+#include "public.h"
+
+//
+//混合dp
+//dp[i][j] 删掉它们用的最小次数
+
+//dp[i][j]等于多个内部分两块然后切开
+//如果arr[i] == arr[j] 那么 dp[i][j] = min(dp[i - 1][j - 1], dp[i][j])
+
+//初始化dp[i][i] = 1
+// dp[i][i + 1] = 2 如果arr[i] != arr[i + 1] 否则 1
+
+class Solution {
+public:
+	int minimumMoves(vector<int>& arr) {
+		int aSize = arr.size();
+		vector<vector<int>> dp(aSize, vector<int>(aSize, INT_MAX));
+
+		for (int i = 0; i < aSize; ++i)
+			dp[i][i] = 1;
+
+		for (int i = 0; i < aSize - 1; ++i)
+		{
+			if (arr[i] == arr[i + 1]) dp[i][i + 1] = 1;
+			else dp[i][i + 1] = 2;
+		}
+
+		for (int len = 3; len <= aSize; ++len)
+		{
+			for (int left = 0; left <= aSize - len; ++left)
+			{
+				int right = left + len - 1;
+				for (int mid = left; mid < right; ++mid)
+				{
+					dp[left][right] = min(dp[left][right], dp[left][mid] + dp[mid + 1][right]);
+				}
+				if (arr[left] == arr[right])
+					dp[left][right] = min(dp[left][right], dp[left + 1][right - 1]);
+			}
+		}
+		return dp[0][aSize - 1];
+	}
+};
+
+/*
+int main()
+{
+	Solution* s = new Solution();
+	vector<int> arr = { 1,2 };
+	cout << s->minimumMoves(arr) << endl;     //2
+	vector<int> arr2 = { 1,3,4,1,5 };
+	cout << s->minimumMoves(arr2) << endl;    //3
+	vector<int> arr3 = { 2,5,1,3,4,1,6,5 };
+	cout << s->minimumMoves(arr3) << endl;    //4
+	vector<int> arr4= { 17,6,5,18,17,4,18,8,16,8,12,1,5,14,14,6,17,18,2,19,11,15,8,18,7,8,20,2,10,3,18,17,18,18,8,9,20,3,16,19,6,9,8,8,16,19,13,8,5,20 };
+	cout << s->minimumMoves(arr4) << endl;    //25
+	return 0;
+}
+*/

cpp/leetcode/leetcode.vcxproj

@@ -413,13 +413,10 @@
     <ClCompile Include="470. implement-rand10-using-rand7.cpp" />
     <ClCompile Include="472. concatenated-words.cpp" />
     <ClCompile Include="473. Matchsticks to Square.cpp" />
-    <ClCompile Include="5230. check-if-it-is-a-straight-line.cpp" />
-    <ClCompile Include="5231. remove-sub-folders-from-the-filesystem.cpp" />
-    <ClCompile Include="5232. replace-the-substring-for-balanced-string.cpp" />
-    <ClCompile Include="5233. maximum-profit-in-job-scheduling.cpp" />
-    <ClCompile Include="5239. circular-permutation-in-binary-representation.cpp" />
-    <ClCompile Include="5240. maximum-length-of-a-concatenated-string-with-unique-characters.cpp" />
-    <ClCompile Include="5241. tiling-a-rectangle-with-the-fewest-squares.cpp" />
+    <ClCompile Include="5096. array-transformation.cpp" />
+    <ClCompile Include="5097. design-a-leaderboard.cpp" />
+    <ClCompile Include="5098. tree-diameter.cpp" />
+    <ClCompile Include="5115. palindrome-removal.cpp" />
     <ClCompile Include="摩尔投票法升级229. majority-element-ii.cpp" />
     <ClCompile Include="230. kth-smallest-element-in-a-bst.cpp" />
     <ClCompile Include="231. power-of-two.cpp" />

cpp/leetcode/leetcode.vcxproj.filters

@@ -1166,25 +1166,16 @@
     <ClCompile Include="472. concatenated-words.cpp">
       <Filter>源文件\HardAlg\前缀树</Filter>
     </ClCompile>
-    <ClCompile Include="5230. check-if-it-is-a-straight-line.cpp">
+    <ClCompile Include="5097. design-a-leaderboard.cpp">
       <Filter>源文件</Filter>
     </ClCompile>
-    <ClCompile Include="5231. remove-sub-folders-from-the-filesystem.cpp">
+    <ClCompile Include="5096. array-transformation.cpp">
       <Filter>源文件</Filter>
     </ClCompile>
-    <ClCompile Include="5232. replace-the-substring-for-balanced-string.cpp">
+    <ClCompile Include="5098. tree-diameter.cpp">
       <Filter>源文件</Filter>
     </ClCompile>
-    <ClCompile Include="5233. maximum-profit-in-job-scheduling.cpp">
-      <Filter>源文件</Filter>
-    </ClCompile>
-    <ClCompile Include="5239. circular-permutation-in-binary-representation.cpp">
-      <Filter>源文件</Filter>
-    </ClCompile>
-    <ClCompile Include="5240. maximum-length-of-a-concatenated-string-with-unique-characters.cpp">
-      <Filter>源文件</Filter>
-    </ClCompile>
-    <ClCompile Include="5241. tiling-a-rectangle-with-the-fewest-squares.cpp">
+    <ClCompile Include="5115. palindrome-removal.cpp">
       <Filter>源文件</Filter>
     </ClCompile>
   </ItemGroup>