solution_867,1437,1608

JinHaLim/Array/solution_1437.js

@@ -0,0 +1,20 @@
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {boolean}
+ */
+var kLengthApart = function(nums, k) {
+    let old = null;
+    for (let i = 0; i < nums.length; i++) {
+        if (nums[i] === 1) {
+            if (old !== null && i- old < k + 1 ) {
+                return false;
+            }
+            old = i;
+        }
+    }
+    return true;
+};
+// console.log(kLengthApart([1,0,0,0,1,0,0,1,0],2))
+// console.log(kLengthApart([1,0,0,0],1))
+console.log(kLengthApart([1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0],100))

JinHaLim/Array/solution_1608.js

@@ -0,0 +1,17 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var specialArray = function(nums) {
+    let x = 0;
+    let count = 0;
+    while (x <= nums.length) {
+        let len = nums.filter((v,i)=>{
+            return v >= x;
+        }).length;
+        if(x === len) return x;
+        x++;
+    }
+    return -1;
+};
+console.log(specialArray([0,0]))

JinHaLim/Array/solution_867.js

@@ -0,0 +1,17 @@
+/**
+ * @param {number[][]} matrix
+ * @return {number[][]}
+ */
+var transpose = function(matrix) {
+    let result = [];
+    let line = [];
+    for (let i = 0; i < matrix[0].length; i++) {
+        line = [];
+        for (let j = 0; j < matrix.length; j++) {
+            line.push(matrix[j][i]);
+        }
+        result.push(line);
+    }
+    return result;
+};
+console.log(transpose([[1,2,3],[4,5,6],[7,8,9]]))