[leet] 다양함 (easy-mid)

Author: hyeonbinHur

허현빈/6주차/260204-1.js

@@ -0,0 +1,19 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var removeDuplicates = function (nums) {
+  const map = new Map();
+  for (let i = nums.length - 1; i >= 0; i--) {
+    if (map.has(nums[i])) {
+      if (map.get(nums[i]) >= 2) {
+        nums.splice(i, 1);
+      } else {
+        map.set(nums[i], map.get(nums[i]) + 1);
+      }
+    } else {
+      map.set(nums[i], 1);
+    }
+  }
+  return nums.length;
+};

허현빈/6주차/260204-2.js

@@ -0,0 +1,22 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var majorityElement = function (nums) {
+  let ans = nums[0];
+  let maxCount = 1;
+  const map = new Map();
+  for (let i = 0; i < nums.length; i++) {
+    if (map.has(nums[i])) {
+      const get = map.get(nums[i]);
+      map.set(nums[i], get + 1);
+      if (get >= maxCount && ans !== nums[i]) {
+        maxCount = get;
+        ans = nums[i];
+      }
+    } else {
+      map.set(nums[i], 1);
+    }
+  }
+  return ans;
+};

허현빈/6주차/260204-3.js

@@ -0,0 +1,11 @@
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {void} Do not return anything, modify nums in-place instead.
+ */
+var rotate = function (nums, k) {
+  let newK = k % nums.length;
+  const spl = nums.splice(nums.length - newK, newK);
+  nums.unshift(...spl);
+  return nums;
+};

허현빈/6주차/260204-4.js

@@ -0,0 +1,13 @@
+/**
+ * @param {number[]} nums
+ * @param {number} val
+ * @return {number}
+ */
+var removeElement = function (nums, val) {
+  for (let i = nums.length - 1; i >= 0; i--) {
+    if (nums[i] === val) {
+      nums.splice(i, 1);
+    }
+  }
+  return nums.length;
+};

허현빈/6주차/260204-5.js

@@ -0,0 +1,15 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var removeDuplicates = function (nums) {
+  const set = new Set();
+  for (let i = nums.length - 1; i >= 0; i--) {
+    if (!set.has(nums[i])) {
+      set.add(nums[i]);
+    } else {
+      nums.splice(i, 1);
+    }
+  }
+  return nums.length;
+};