solve 855

Author: StephenLeeUSTC

src/problem/mod.rs

@@ -1 +0,0 @@
-mod p0855_exam_room;

src/problem/p0925_long_pressed_name.rs

@@ -0,0 +1,61 @@
+/**
+ * [925] Long Pressed Name
+ *
+ * Your friend is typing his name into a keyboard. Sometimes, when typing a character c, the key might get long pressed, and the character will be typed 1 or more times.
+ * You examine the typed characters of the keyboard. Return True if it is possible that it was your friends name, with some characters (possibly none) being long pressed.
+ *  
+ * Example 1:
+ * 
+ * Input: name = "alex", typed = "aaleex"
+ * Output: true
+ * Explanation: 'a' and 'e' in 'alex' were long pressed.
+ * 
+ * Example 2:
+ * 
+ * Input: name = "saeed", typed = "ssaaedd"
+ * Output: false
+ * Explanation: 'e' must have been pressed twice, but it wasn't in the typed output.
+ * 
+ * Example 3:
+ * 
+ * Input: name = "leelee", typed = "lleeelee"
+ * Output: true
+ * 
+ * Example 4:
+ * 
+ * Input: name = "laiden", typed = "laiden"
+ * Output: true
+ * Explanation: It's not necessary to long press any character.
+ * 
+ *  
+ * Constraints:
+ * 
+ * 	1 <= name.length <= 1000
+ * 	1 <= typed.length <= 1000
+ * 	name and typed contain only lowercase English letters.
+ * 
+ */
+pub struct Solution {}
+
+// problem: https://leetcode.com/problems/long-pressed-name/
+// discuss: https://leetcode.com/problems/long-pressed-name/discuss/?currentPage=1&orderBy=most_votes&query=
+
+// submission codes start here
+
+impl Solution {
+    pub fn is_long_pressed_name(name: String, typed: String) -> bool {
+        
+        false
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_925() {
+    }
+}

src/solution/mod.rs

@@ -40,3 +40,4 @@ mod s0203_remove_linked_list_elements;
 mod s1049_last_stone_weight_ii;
 mod s0455_assign_cookies;
 mod s0986_interval_list_intersections;
+mod s0855_exam_room;

src/problem/p0855_exam_room.rs renamed to src/solution/s0855_exam_room.rs

@@ -42,10 +42,10 @@ pub struct Solution {}
 
 // submission codes start here
 
-use std::collections::HashSet;
+use std::collections::BTreeSet;
 
 struct ExamRoom {
-    seats: HashSet<i32>,
+    seats: BTreeSet<i32>,
     capacity: i32,
 }
 
@@ -58,12 +58,13 @@ impl ExamRoom {
 
     fn new(n: i32) -> Self {
         ExamRoom {
-            seats : HashSet::new(),
+            seats : BTreeSet::new(),
             capacity: n,
         }
     }
 
     fn seat(&mut self) -> i32 {
+        // println!("seats is {:?}", self.seats);
         if self.seats.len() == 0 {
             self.seats.insert(0);
             return 0;
@@ -72,19 +73,22 @@ impl ExamRoom {
         let (mut left, mut right) = (0, 0);
         let mut max_distance = 0;
         let mut pre = 0;
+        let mut pick = 0;
         for (i, item) in self.seats.iter().enumerate() {
-            println!("i is {}, item is {}", i, *item);
-            if pre == 0 {
+            // println!("i is {}, item is {}", i, *item);
+            if i == 0 && *item != 0 {
                 if *item - pre > max_distance {
                     left = pre;
                     right = *item;
                     max_distance = right - left;
+                    pick = 0;
                 }
             } else {
                 if (*item - pre) / 2 > max_distance {
                     left = pre;
                     right = *item;
                     max_distance = (right - left) / 2;
+                    pick = left + max_distance;
                 }
             }
 
@@ -95,22 +99,12 @@ impl ExamRoom {
             left = pre;
             right = self.capacity - 1;
             max_distance = right - left;
+            pick = right;
         }
-        println!("left is {}, right is {}", left, right);
+        // println!("left is {}, right is {}", left, right);
 
-        if left == 0 {
-            self.seats.insert(left);
-            return left;
-        } else if right == self.capacity - 1 {
-            self.seats.insert(right);
-            return right;
-        } else {
-            let res = left + (right - left) / 2;
-            self.seats.insert(res);
-            return res;
-        }
-
-        0
+        self.seats.insert(pick);
+        pick
     }
 
     fn leave(&mut self, p: i32) {