Change File structure

tumanob · tumanob · commit 45ac5e1ce3e1 · 2022-05-05T20:45:02.000-07:00
diff --git a/ScalaSolutions/build.sbt b/ScalaSolutions/build.sbt
@@ -1,12 +1,12 @@
-val dottyVersion = "0.26.0-RC1"
+//val dottyVersion = "0.26.0-RC1"
 
 lazy val root = project
   .in(file("."))
   .settings(
-    name := "dotty-simple",
+    name := "LeetCode Scala Solutions",
     version := "0.1.0",
 
-    scalaVersion := dottyVersion,
+    scalaVersion := 3.1,
 
     libraryDependencies += "com.novocode" % "junit-interface" % "0.11" % "test"
   )
diff --git a/ScalaSolutions/src/main/scala/Main.scala b/ScalaSolutions/src/main/scala/Main.scala
diff --git a/ScalaSolutions/src/main/scala/p1_TwoSum.scala b/ScalaSolutions/src/main/scala/p1_TwoSum.scala
@@ -1,5 +1,3 @@
-package TwoSum_p1
-
 /**
  * https://leetcode.com/problems/two-sum/
  * Given an array of integers nums and an integer target, 
@@ -9,7 +7,7 @@ package TwoSum_p1
  * You can return the answer in any order.
  * @tags: easy
  */
-object Solution {
+object p1_TwoSum {
 
   def twoSum(nums: Array[Int], target: Int): Array[Int] = {
     def twoSum(index: Int, previous: Map[Int, Int]): Array[Int] = {
diff --git a/ScalaSolutions/src/main/scala/p20_ValidParentheses.scala b/ScalaSolutions/src/main/scala/p20_ValidParentheses.scala
@@ -1,5 +1,3 @@
-package ValidParentheses_p20
-
 import scala.collection.mutable.Stack
 
 /**
@@ -12,7 +10,7 @@ import scala.collection.mutable.Stack
  *
  * @tags: easy
  */
-object Solution {
+object p20_ValidParentheses {
 
   import scala.collection.mutable.Stack
   val stack = new Stack[Char]()
diff --git a/ScalaSolutions/src/main/scala/p69_SqrtX.scala b/ScalaSolutions/src/main/scala/p69_SqrtX.scala
@@ -1,12 +1,10 @@
-package Sqrt_p69
-
 /**
  * https://leetcode.com/problems/sqrtx/
  * Given a non-negative integer x, compute and return the square root of x.
  * Since the return type is an integer, the decimal digits are truncated, 
  * and only the integer part of the result is returned.
  */
-object Solution {
+object p69_SqrtX {
   /**
    * I am gonna Use Newton's method to calculate it as it is fun 
    * and used in many functional programing courses as a reference
diff --git a/ScalaSolutions/src/main/scala/worksheet.sc b/ScalaSolutions/src/main/scala/worksheet.sc
@@ -2,6 +2,14 @@
  * For tests and checks
  */
 
-object Solution {
 
-}
+// Creating a map
+val OpenToClose: Map[Char, Char] = Map('{' -> '}', '[' -> ']', '(' -> ')')
+
+// Applying contains method
+val result = OpenToClose.contains(2)
+val result2 = OpenToClose.contains(3)
+
+// Displays output
+println(result)
+println(result2)
