Create Scala solution of problem 115.

godkingjay · Oct 31, 2023 · e4a6e27 · e4a6e27
1 parent 1b9858a
commit e4a6e27
Showing 1 changed file with 27 additions and 0 deletions.
diff --git a/Hard/115. Distinct Subsequences/Approach 1/solution.scala b/Hard/115. Distinct Subsequences/Approach 1/solution.scala
@@ -0,0 +1,27 @@
+object Solution {
+    def numDistinct(s: String, t: String): Int = {
+        val m = s.length
+        val n = t.length
+
+        if (m < n) {
+            return 0
+        }
+
+        val dp: Array[Array[Int]] = Array.fill(m + 1, n + 1)(0)
+        for (i <- 0 to m) {
+            dp(i)(0) = 1
+        }
+
+        for (i <- 1 to m) {
+            for (j <- 1 to n) {
+                if (s(i-1) == t(j-1)) {
+                    dp(i)(j) = dp(i-1)(j-1) + dp(i-1)(j)
+                } else {
+                    dp(i)(j) = dp(i-1)(j)
+                }
+            }
+        }
+
+        dp(m)(n)
+    }
+}