[황은지] Day15

leetcode3/황은지/1539. Kth Missing Positive Number.js

@@ -0,0 +1,17 @@
+/**
+ * @param {number[]} arr
+ * @param {number} k
+ * @return {number}
+ */
+var findKthPositive = function(arr, k) {
+    const set=new Set(arr);
+
+    let count=0;
+
+    for(let i=1;i<=100000;i++){
+        if(!set.has(i)){
+            count++;
+            if(count===k) return i;
+        }
+    }
+};

leetcode3/황은지/611. Valid Triangle Number.js

@@ -0,0 +1,20 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var triangleNumber = function (nums) {
+  // 가장 긴 변이 나머지 두변 합보다 작아야됨
+  let count = 0;
+  nums.sort((a, b) => b - a);
+
+  for (let i = 0; i < nums.length; i++) {
+    for (let j = i + 1; j < nums.length; j++) {
+      for (let k = j + 1; k < nums.length; k++) {
+        if (nums[i] >= nums[j] + nums[k]) break;
+        count++;
+      }
+    }
+  }
+
+  return count;
+};