use scalafmt.

Author: counter2015

.scalafmt.conf

@@ -0,0 +1,11 @@
+version = 3.9.3
+
+maxColumn      = 120
+rewrite.rules  = [RedundantBraces, RedundantParens, SortImports]
+runner.dialect = scala213
+
+continuationIndent {
+  callSite = 2
+  defnSite = 2
+  extendSite = 2
+}

build.sbt

@@ -4,7 +4,6 @@ organization := "com.counter2015"
 
 version := "1.0"
 
-// same version to leetcode.com
 scalaVersion := "2.13.16"
 
 
@@ -27,4 +26,7 @@ scalacOptions ++= Seq(
    -F - show full stack traces
  */
 Test / testOptions += Tests.Argument("-oD")
-Global / onChangedBuildSource := ReloadOnSourceChanges
+Global / onChangedBuildSource := ReloadOnSourceChanges
+
+scalafmtOnCompile := true
+semanticdbEnabled := true

project/plugins.sbt

@@ -1 +1,4 @@
-addSbtPlugin("org.scoverage" % "sbt-scoverage" % "2.3.1")
+addSbtPlugin("org.scoverage" % "sbt-scoverage" % "2.3.1")
+
+//sbt-scalafmt https://github.com/scalameta/sbt-scalafmt
+addSbtPlugin("org.scalameta" % "sbt-scalafmt" % "2.5.4")

src/main/scala/algorithms/easy/basic/CountAndSay.scala

@@ -2,11 +2,12 @@ package algorithms.easy.basic
 
 object CountAndSay {
 
-  /** RunTime Info:
-    * 268 ms, 48.6 MB
+  /** RunTime Info: 268 ms, 48.6 MB
     *
-    * @param n the nth String of `CountAndSay`
-    * @return the spell string
+    * @param n
+    *   the nth String of `CountAndSay`
+    * @return
+    *   the spell string
     */
   def countAndSay(n: Int): String = {
 

src/main/scala/algorithms/easy/basic/ExcelSheetColumnTitle.scala

@@ -2,17 +2,17 @@ package algorithms.easy.basic
 
 object ExcelSheetColumnTitle {
 
-  /** Runtime Info:
-    * 495 ms, 53.32 MB
+  /** Runtime Info: 495 ms, 53.32 MB
     *
     * @param columnNumber
-    * @return the 26 radix-string
+    * @return
+    *   the 26 radix-string
     */
   def convertToTitle(columnNumber: Int): String = {
     val radix = 26
 
     @scala.annotation.tailrec
-    def calcTitle(n: Int, res: String = ""): String = {
+    def calcTitle(n: Int, res: String = ""): String =
       if (n > radix) {
         val r = n % radix
         if (r != 0) {
@@ -23,7 +23,6 @@ object ExcelSheetColumnTitle {
       } else {
         ('A' + n - 1).toChar.toString + res
       }
-    }
 
     calcTitle(columnNumber)
   }

src/main/scala/algorithms/easy/basic/InsertionNode.scala

@@ -4,17 +4,18 @@ import algorithms.struct.ListNode
 
 object InsertionNode {
 
-  /** RunTime Info:
-    * 556 ms, 55.3 MB
+  /** RunTime Info: 556 ms, 55.3 MB
     *
-    * @param headA head of list node A
-    * @param headB head of list node B
-    * @return the insertion node or null
+    * @param headA
+    *   head of list node A
+    * @param headB
+    *   head of list node B
+    * @return
+    *   the insertion node or null
     */
   def getIntersectionNode(headA: ListNode, headB: ListNode): ListNode = {
-    def listLength(l: ListNode): Int = {
+    def listLength(l: ListNode): Int =
       if (l == null) 0 else 1 + listLength(l.next)
-    }
 
     val (a, b) = (listLength(headA), listLength(headB))
     var (x, y) = (headA, headB)

src/main/scala/algorithms/easy/basic/LengthOfLastWord.scala

@@ -2,13 +2,13 @@ package algorithms.easy.basic
 
 object LengthOfLastWord {
 
-  /** RunTime Info:
-    * 240 ms, 44.2 MB
+  /** RunTime Info: 240 ms, 44.2 MB
     *
-    * @param s input string
-    * @return length of last word
+    * @param s
+    *   input string
+    * @return
+    *   length of last word
     */
-  def lengthOfLastWord(s: String): Int = {
+  def lengthOfLastWord(s: String): Int =
     if (s.filter(_ != ' ').length == 0) 0 else s.split(" ").last.length
-  }
 }

src/main/scala/algorithms/easy/basic/ListCycle.scala

@@ -4,13 +4,14 @@ import algorithms.struct.ListNode
 
 object ListCycle {
 
-  /** RunTime Info:
-    * 484 ms, 50.7 MB
+  /** RunTime Info: 484 ms, 50.7 MB
     *
-    * @param head the head node of list
-    * @return whether the list nodes have cycle
+    * @param head
+    *   the head node of list
+    * @return
+    *   whether the list nodes have cycle
     */
-  def hasCycle(head: ListNode): Boolean = {
+  def hasCycle(head: ListNode): Boolean =
     if (head == null) false
     else {
       var fast = head
@@ -22,5 +23,4 @@ object ListCycle {
       }
       false
     }
-  }
 }

src/main/scala/algorithms/easy/basic/LongestCommonPrefix.scala

@@ -2,19 +2,19 @@ package algorithms.easy.basic
 
 object LongestCommonPrefix {
 
-  /** RunTime Info:
-    * 244 ms, 44.8 MB
+  /** RunTime Info: 244 ms, 44.8 MB
     *
-    * @param strs a string array
-    * @return the longest common prefix string the input Array[string]
+    * @param strs
+    *   a string array
+    * @return
+    *   the longest common prefix string the input Array[string]
     */
   def longestCommonPrefix(strs: Array[String]): String = {
     if (strs.length == 0) return ""
     val length = strs.map(_.length).min
     val num = strs.length
-    for (l <- 0 until length; n <- 1 until num) {
+    for (l <- 0 until length; n <- 1 until num)
       if (strs(n - 1)(l) != strs(n)(l)) return strs(0).slice(0, l)
-    }
     strs(0).slice(0, length)
   }
 }

src/main/scala/algorithms/easy/basic/PalindromeNumber.scala

@@ -2,13 +2,13 @@ package algorithms.easy.basic
 
 object PalindromeNumber {
 
-  /** RunTime Info:
-    * 292 ms, 46.7 MB
+  /** RunTime Info: 292 ms, 46.7 MB
     *
-    * @param x input integer
-    * @return check the integer is palindrome or not
+    * @param x
+    *   input integer
+    * @return
+    *   check the integer is palindrome or not
     */
-  def isPalindrome(x: Int): Boolean = {
+  def isPalindrome(x: Int): Boolean =
     x.toString.reverse == x.toString
-  }
 }