Merge branch 'release/1.0.17.0'

Author: andersonkmi

README.md

@@ -30,8 +30,11 @@ to keep up with the language and learn how to use the Scala test library as well
 * Word break
 * Roman to integer
 * Maximum SubArray
+* Partition list
 
 ## Versions
+* 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.
 
 * 1.0.15.0 (07/16/2018) - Added Roman to Integer exercise.

build.sbt

@@ -5,7 +5,7 @@ lazy val root = (project in file(".")).
     inThisBuild(List(
       organization := "com.example",
       scalaVersion := "2.12.6",
-      version      := "1.0.16.0"
+      version      := "1.0.17.0"
     )),
     name := "leetcode-scala",
     libraryDependencies += scalaTest % Test,

src/main/scala/org/sharpsw/leetcode/PartitionList.scala

@@ -0,0 +1,39 @@
+package org.sharpsw.leetcode
+
+import scala.collection.mutable.ListBuffer
+
+object PartitionList {
+  def partition(head: ListNode, x: Int): ListNode = {
+    val smaller = ListBuffer.empty[Int]
+    val higher = ListBuffer.empty[Int]
+
+    var item = head
+    while(item != null) {
+      if(item._x < x) {
+        smaller += item._x
+      } else {
+        higher += item._x
+      }
+
+      item = item.next
+    }
+
+    val finalResult = smaller ++ higher
+
+    if(finalResult.nonEmpty) {
+      val convertedNodes = finalResult.map(item => new ListNode(item))
+      val headNode = convertedNodes.head
+      var currentNode = headNode
+
+      var index = 1
+      while(index < convertedNodes.size) {
+        val node = convertedNodes(index)
+        currentNode.next = node
+        index += 1
+        currentNode = node
+      }
+
+      headNode
+    } else null
+  }
+}

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

@@ -0,0 +1,22 @@
+package org.sharpsw.leetcode
+
+import org.scalatest.{FlatSpec, Matchers}
+import org.sharpsw.leetcode.PartitionList._
+
+class PartitionListSpec extends FlatSpec with Matchers {
+  "Test 001" should "OK" 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)
+    node1.next = node2
+    node2.next = node3
+    node3.next = node4
+    node4.next = node5
+    node5.next = node6
+    val result = partition(node1, 3)
+    ListNodeUtils.mkString(result) shouldEqual "1-2-2-4-3-5"
+  }
+}