add: 220109-CN

2201/220109-CN.cpp

@@ -0,0 +1,34 @@
+#include <vector>
+#include <string>
+
+/**
+ * 1629. Slowest Key
+ * A newly designed keypad was tested, where a tester pressed a sequence of n keys, one at a time.
+ * You are given a string keysPressed of length n, where keysPressed[i] was the ith key pressed in the testing sequence, and a sorted list releaseTimes, where releaseTimes[i] was the time the ith key was released. Both arrays are 0-indexed. The 0th key was pressed at the time 0, and every subsequent key was pressed at the exact time the previous key was released.
+ * The tester wants to know the key of the keypress that had the longest duration. The ith keypress had a duration of releaseTimes[i] - releaseTimes[i - 1], and the 0th keypress had a duration of releaseTimes[0].
+ * Note that the same key could have been pressed multiple times during the test, and these multiple presses of the same key may not have had the same duration.
+ * Return the key of the keypress that had the longest duration. If there are multiple such keypresses, return the lexicographically largest key of the keypresses.
+ */
+
+class Solution {
+public:
+	static char slowestKey(const std::vector<int>& releaseTimes, const std::string& keysPressed) {
+		int len = keysPressed.length(), max = 0, prev = 0;
+		char ret = 0;
+		for (int i = 0; i < len; ++i) {
+			if (releaseTimes[i] - prev > max) {
+				max = releaseTimes[i] - prev;
+				ret = keysPressed[i];
+			} else if (releaseTimes[i] - prev == max) {
+				ret = std::max(ret, keysPressed[i]);
+			}
+			prev = releaseTimes[i];
+		}
+		return ret;
+	}
+};
+
+int main() {
+	std::printf("%c\n", Solution::slowestKey({9, 29, 49, 50}, "cbcd"));
+	return 0;
+}

2201/CMakeLists.txt

@@ -3,4 +3,4 @@ PROJECT(2201)
 
 SET(CMAKE_CXX_STANDARD 23)
 
-ADD_EXECUTABLE(2201 220108.cpp)
+ADD_EXECUTABLE(2201 220109-CN.cpp)