Merge pull request #1917 from CodingTestStudy2/염혜정

[염혜정] Day28

Author: github-actions[bot]

leetcode3/염혜정/3940. Limit Occurrences in Sorted Array.java

@@ -0,0 +1,17 @@
+// o(n)
+
+class Solution {
+    public int[] limitOccurrences(int[] nums, int k) {
+        int n = nums.length, idx = 0;
+        int[] res = new int[n];
+        int i = 0;
+        while (i < n) {
+            int j = i;
+            while (j < n && nums[j] == nums[i]) j++;
+            int count = Math.min(j - i, k);
+            for (int c = 0; c < count; c++) res[idx++] = nums[i];
+            i = j;
+        }
+        return java.util.Arrays.copyOf(res, idx);
+    }
+}