feat: leetcode_weekly_267

OneCodeMonkey · OneCodeMonkey · commit 95b5fbd644c9 · 2021-11-28T22:08:13.000+08:00
diff --git a/contest/leetcode_week_267/[editing]leetcode_2076_Process_Restricted_Friend_Requests.java b/contest/leetcode_week_267/[editing]leetcode_2076_Process_Restricted_Friend_Requests.java
diff --git a/contest/leetcode_week_267/leetcode_2073_Time_Needed_to_Buy_Tickets.java b/contest/leetcode_week_267/leetcode_2073_Time_Needed_to_Buy_Tickets.java
@@ -0,0 +1,19 @@
+class Solution {
+    public int timeRequiredToBuy(int[] tickets, int k) {
+        int size = tickets.length, ret = 0;
+
+        while (tickets[k] > 0) {
+            for (int i = 0; i < size; i++) {
+                if (tickets[i] > 0) {
+                    tickets[i]--;
+                    ret++;
+                    if (tickets[k] == 0) {
+                        return ret;
+                    }
+                }
+            }
+        }
+
+        return ret;
+    }
+}
diff --git a/contest/leetcode_week_267/leetcode_2074_Reverse_Nodes_in_Even_Length_Groups.java b/contest/leetcode_week_267/leetcode_2074_Reverse_Nodes_in_Even_Length_Groups.java
@@ -0,0 +1,42 @@
+class Solution {
+    public ListNode reverseEvenLengthGroups(ListNode head) {
+        int groupSize = 1;
+        List<List<ListNode>> record = new ArrayList<>();
+        ListNode headCopy = head;
+        while (headCopy != null) {
+            List<ListNode> tempList = new ArrayList<>();
+            for (int i = 0; i < groupSize && headCopy != null; i++) {
+                tempList.add(headCopy);
+                headCopy = headCopy.next;
+            }
+            record.add(tempList);
+            groupSize++;
+        }
+//        for (List<ListNode> listNodes : record) {
+//            for (ListNode listNode : listNodes) {
+//                System.out.print(listNode.val + " ");
+//            }
+//            System.out.println();
+//        }
+
+        ListNode retPrev = new ListNode(-1), ret = retPrev;
+        for (List<ListNode> listNodes : record) {
+            if (listNodes.size() % 2 == 0) {
+                Collections.reverse(listNodes);
+
+//                for (ListNode listNode : listNodes) {
+//                    System.out.print("reverse:" + listNode.val + " ");
+//                }
+//                System.out.println();
+            }
+            for (ListNode listNode : listNodes) {
+                ret.next = listNode;
+//                System.out.print("single val: " + listNode.val + " ");
+                ret = ret.next;
+            }
+        }
+        ret.next = null;
+
+        return retPrev.next;
+    }
+}
diff --git a/contest/leetcode_week_267/leetcode_2075_Decode_the_Slanted_Ciphertext.java b/contest/leetcode_week_267/leetcode_2075_Decode_the_Slanted_Ciphertext.java
@@ -0,0 +1,21 @@
+class Solution {
+    public String decodeCiphertext(String encodedText, int rows) {
+        int size = encodedText.length(), cols = size / rows, posX = 0, posY = 0, pos = 0;
+        if (rows == 1 || size <= 1) {
+            return encodedText;
+        }
+        StringBuilder ret = new StringBuilder();
+        while (posY < cols) {
+            int index = posX * cols + posY;
+            ret.append(encodedText.charAt(index));
+            posX++;
+            posY++;
+            if (posX >= rows) {
+                posX = 0;
+                posY = posY - rows + 1;
+            }
+            pos++;
+        }
+        return ret.toString().replaceAll("\\s+$","");
+    }
+}
