Create: 0989-add-to-array-form-of-integer

Author: AkifhanIlgaz

go/0989-add-to-array-form-of-integer.go

@@ -0,0 +1,37 @@
+package main
+
+func main() {
+
+}
+
+func addToArrayForm(num []int, k int) []int {
+	// Reverse
+	for i, j := 0, len(num)-1; i < j; i, j = i+1, j-1 {
+		num[i], num[j] = num[j], num[i]
+	}
+	i := 0
+
+	for k > 0 {
+		digit := k % 10
+
+		if i < len(num) {
+			num[i] += digit
+		} else {
+			num = append(num, digit)
+		}
+
+		carry := num[i] / 10
+		num[i] %= 10
+
+		k /= 10
+		k += carry
+		i++
+	}
+
+	// Reverse
+	for i2, j := 0, len(num)-1; i2 < j; i2, j = i2+1, j-1 {
+		num[i2], num[j] = num[j], num[i2]
+	}
+
+	return num
+}

javascript/0989-add-to-array-form-of-integer.js

@@ -0,0 +1,23 @@
+/**
+ * @param {number[]} num
+ * @param {number} k
+ * @return {number[]}
+ */
+var addToArrayForm = function (num, k) {
+    num.reverse();
+    let i = 0;
+
+    while (k > 0) {
+        const digit = k % 10;
+        i < num.length ? (num[i] += digit) : num.push(digit);
+
+        const carry = Math.floor(num[i] / 10);
+        num[i] %= 10;
+
+        k = Math.floor(k / 10);
+        k += carry;
+        i++;
+    }
+
+    return num.reverse();
+};

rust/0989-add-to-array-form-of-integer.rs

@@ -0,0 +1,26 @@
+impl Solution {
+    pub fn add_to_array_form(num: Vec<i32>, k: i32) -> Vec<i32> {
+        let mut num: Vec<i32> = num.into_iter().rev().collect();
+        let mut k = k;
+        let mut i = 0;
+
+        while k > 0 {
+            let digit = k % 10;
+
+            if i < num.len() {
+                num[i] += digit;
+            } else {
+                num.push(digit);
+            }
+
+            let carry = num[i] / 10;
+            num[i] = num[i] % 10;
+
+            k /= 10;
+            k += carry;
+            i += 1;
+        }
+
+        num.into_iter().rev().collect()
+    }
+}

typescript/0989-add-to-array-form-of-integer..ts

@@ -0,0 +1,18 @@
+function addToArrayForm(num: number[], k: number): number[] {
+    num.reverse();
+    let i = 0;
+
+    while (k > 0) {
+        const digit = k % 10;
+        i < num.length ? (num[i] += digit) : num.push(digit);
+
+        const carry = Math.floor(num[i] / 10);
+        num[i] %= 10;
+
+        k = Math.floor(k / 10);
+        k += carry;
+        i++;
+    }
+
+    return num.reverse();
+}