Added 62-Unique-Paths.kt and 1143-Longest-Common-Subsequence.kt

Author: Raven1233

kotlin/1143-Longest-Common-Subsequence.kt

@@ -0,0 +1,23 @@
+class Solution {
+	fun longestCommonSubsequence(text1: String, text2: String): Int {
+		if (text1.isEmpty() || text2.isEmpty()) {
+			return 0
+		}
+
+		val M = text1.length
+		val N = text2.length
+
+		val dp = Array(M + 1){IntArray(N + 1){0}}
+
+		for (i in 1..M) {
+			for (j in 1..N) {
+				if (text1[i - 1] == text2[j - 1]) {
+					dp[i][j] = dp[i - 1][j - 1] + 1
+				} else {
+					dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1])
+				}
+			}
+		}
+		return dp[M][N]
+	}
+}

kotlin/62-Unique-Paths.kt

@@ -0,0 +1,17 @@
+class Solution {
+    fun uniquePaths(m: Int, n: Int): Int {
+      val dp = Array(m + 1) { IntArray(n + 1) { 0 } }
+        val indexM = m - 1
+        val indexN = n - 1
+        for (i in indexM downTo 0) {
+            for (j in indexN downTo 0) {
+                if (i == indexM && j == indexN) {
+                    dp[i][j] = 1
+                } else {
+                    dp[i][j] = dp[i + 1][j] + dp[i][j + 1]
+                }
+            }
+        }
+        return dp[0][0]
+    }
+}