feat: add js/ts solutions to lc problem: No.0650 (doocs#3434)

Author: rain84

solution/0600-0699/0650.2 Keys Keyboard/README.md

@@ -277,6 +277,48 @@ func minSteps(n int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function minSteps(n: number): number {
+    const dp = Array(n + 1).fill(1000);
+    dp[1] = 0;
+
+    for (let i = 2; i <= n; i++) {
+        for (let j = 1, half = i / 2; j <= half; j++) {
+            if (i % j === 0) {
+                dp[i] = Math.min(dp[i], dp[j] + i / j);
+            }
+        }
+    }
+
+    return dp[n];
+}
+```
+
+#### JavaScript
+
+```js
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var minSteps = function (n) {
+    const dp = Array(n + 1).fill(1000);
+    dp[1] = 0;
+
+    for (let i = 2; i <= n; i++) {
+        for (let j = 1, half = i / 2; j <= half; j++) {
+            if (i % j === 0) {
+                dp[i] = Math.min(dp[i], dp[j] + i / j);
+            }
+        }
+    }
+
+    return dp[n];
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0600-0699/0650.2 Keys Keyboard/README_EN.md

@@ -256,6 +256,48 @@ func minSteps(n int) int {
 }
 ```
 
+#### TypeScript
+
+```ts
+function minSteps(n: number): number {
+    const dp = Array(n + 1).fill(1000);
+    dp[1] = 0;
+
+    for (let i = 2; i <= n; i++) {
+        for (let j = 1, half = i / 2; j <= half; j++) {
+            if (i % j === 0) {
+                dp[i] = Math.min(dp[i], dp[j] + i / j);
+            }
+        }
+    }
+
+    return dp[n];
+}
+```
+
+#### JavaScript
+
+```js
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var minSteps = function (n) {
+    const dp = Array(n + 1).fill(1000);
+    dp[1] = 0;
+
+    for (let i = 2; i <= n; i++) {
+        for (let j = 1, half = i / 2; j <= half; j++) {
+            if (i % j === 0) {
+                dp[i] = Math.min(dp[i], dp[j] + i / j);
+            }
+        }
+    }
+
+    return dp[n];
+};
+```
+
 <!-- tabs:end -->
 
 <!-- solution:end -->

solution/0600-0699/0650.2 Keys Keyboard/Solution2.js

@@ -0,0 +1,18 @@
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var minSteps = function (n) {
+    const dp = Array(n + 1).fill(1000);
+    dp[1] = 0;
+
+    for (let i = 2; i <= n; i++) {
+        for (let j = 1, half = i / 2; j <= half; j++) {
+            if (i % j === 0) {
+                dp[i] = Math.min(dp[i], dp[j] + i / j);
+            }
+        }
+    }
+
+    return dp[n];
+};

solution/0600-0699/0650.2 Keys Keyboard/Solution2.ts

@@ -0,0 +1,14 @@
+function minSteps(n: number): number {
+    const dp = Array(n + 1).fill(1000);
+    dp[1] = 0;
+
+    for (let i = 2; i <= n; i++) {
+        for (let j = 1, half = i / 2; j <= half; j++) {
+            if (i % j === 0) {
+                dp[i] = Math.min(dp[i], dp[j] + i / j);
+            }
+        }
+    }
+
+    return dp[n];
+}