Merge branch 'release/v1.0.17.1'

Author: andersonkmi

README.md

@@ -33,6 +33,8 @@ to keep up with the language and learn how to use the Scala test library as well
 * Partition list
 
 ## Versions
+* 1.0.17.0 (09/23/2018) - Added few more unit tests for partition list exercise.
+
 * 1.0.17.0 (09/19/2018) - Added Partition List exercise.
 
 * 1.0.16.0 (07/21/2018) - Added Maximum SubArray exercise - not optimized version.

src/test/scala/org/sharpsw/leetcode/PartitionListSpec.scala

@@ -4,7 +4,7 @@ import org.scalatest.{FlatSpec, Matchers}
 import org.sharpsw.leetcode.PartitionList._
 
 class PartitionListSpec extends FlatSpec with Matchers {
-  "Test 001" should "OK" in {
+  "1->4->3->2->5->2 and x = 2" should "return 1-2-2-4-3-5" in {
     val node1 = new ListNode(1)
     val node2 = new ListNode(4)
     val node3 = new ListNode(3)
@@ -19,4 +19,36 @@ class PartitionListSpec extends FlatSpec with Matchers {
     val result = partition(node1, 3)
     ListNodeUtils.mkString(result) shouldEqual "1-2-2-4-3-5"
   }
+
+  "1->4->3->2->5->2->3" should "return 1-2-2-4-3-5-3" in {
+    val node1 = new ListNode(1)
+    val node2 = new ListNode(4)
+    val node3 = new ListNode(3)
+    val node4 = new ListNode(2)
+    val node5 = new ListNode(5)
+    val node6 = new ListNode(2)
+    val node7 = new ListNode(3)
+    node1.next = node2
+    node2.next = node3
+    node3.next = node4
+    node4.next = node5
+    node5.next = node6
+    node6.next = node7
+
+    val result = partition(node1, 3)
+    ListNodeUtils.mkString(result) shouldEqual "1-2-2-4-3-5-3"
+  }
+
+  "1->4->2-10" should "return 1-2-4-10" in {
+    val node1 = new ListNode(1)
+    val node2 = new ListNode(4)
+    val node3 = new ListNode(2)
+    val node4 = new ListNode(10)
+    node1.next = node2
+    node2.next = node3
+    node3.next = node4
+
+    val result = partition(node1, 3)
+    ListNodeUtils.mkString(result) shouldEqual "1-2-4-10"
+  }
 }