Skip some boring problems

Author: aylei

src/lib.rs

@@ -136,3 +136,5 @@ mod n0135_candy;
 mod n0136_single_number;
 mod n0137_single_number_ii;
 mod n0139_word_break;
+mod n0140_word_break_ii;
+mod n0143_reorder_list;

src/n0140_word_break_ii.rs

@@ -0,0 +1,70 @@
+/**
+ * [140] Word Break II
+ *
+ * Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences.
+ * 
+ * Note:
+ * 
+ * 
+ * 	The same word in the dictionary may be reused multiple times in the segmentation.
+ * 	You may assume the dictionary does not contain duplicate words.
+ * 
+ * 
+ * Example 1:
+ * 
+ * 
+ * Input:
+ * s = "catsanddog"
+ * wordDict = ["cat", "cats", "and", "sand", "dog"]
+ * Output:
+ * [
+ *   "cats and dog",
+ *   "cat sand dog"
+ * ]
+ * 
+ * 
+ * Example 2:
+ * 
+ * 
+ * Input:
+ * s = "pineapplepenapple"
+ * wordDict = ["apple", "pen", "applepen", "pine", "pineapple"]
+ * Output:
+ * [
+ *   "pine apple pen apple",
+ *   "pineapple pen apple",
+ *   "pine applepen apple"
+ * ]
+ * Explanation: Note that you are allowed to reuse a dictionary word.
+ * 
+ * 
+ * Example 3:
+ * 
+ * 
+ * Input:
+ * s = "catsandog"
+ * wordDict = ["cats", "dog", "sand", "and", "cat"]
+ * Output:
+ * []
+ * 
+ */
+pub struct Solution {}
+
+// submission codes start here
+
+impl Solution {
+    pub fn word_break(s: String, word_dict: Vec<String>) -> Vec<String> {
+        vec![]
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_140() {
+    }
+}

src/n0143_reorder_list.rs

@@ -0,0 +1,48 @@
+/**
+ * [143] Reorder List
+ *
+ * Given a singly linked list L: L0&rarr;L1&rarr;&hellip;&rarr;Ln-1&rarr;Ln,<br />
+ * reorder it to: L0&rarr;Ln&rarr;L1&rarr;Ln-1&rarr;L2&rarr;Ln-2&rarr;&hellip;
+ * 
+ * You may not modify the values in the list's nodes, only nodes itself may be changed.
+ * 
+ * Example 1:
+ * 
+ * 
+ * Given 1->2->3->4, reorder it to 1->4->2->3.
+ * 
+ * Example 2:
+ * 
+ * 
+ * Given 1->2->3->4->5, reorder it to 1->5->2->4->3.
+ * 
+ * 
+ */
+pub struct Solution {}
+use super::util::linked_list::{ListNode, to_list};
+
+// submission codes start here
+
+/*
+  1->2->3->4->5
+
+  1->2->3<-4<-5
+
+  1->5->2->4->3
+ */
+impl Solution {
+    pub fn reorder_list(head: &mut Option<Box<ListNode>>) {
+        // TODO
+    }
+}
+
+// submission codes end
+
+#[cfg(test)]
+mod tests {
+    use super::*;
+
+    #[test]
+    fn test_143() {
+    }
+}