070425

Author: aluferraz

leetcode/editor/en/Q2780/MinimumIndexOfAValidSplit.py

@@ -0,0 +1,39 @@
+import collections
+from typing import List
+
+import sortedcontainers
+
+
+# leetcode submit region begin(Prohibit modification and deletion)
+class Solution:
+    def minimumIndex(self, nums: List[int]) -> int:
+        def get_dominant(arr):
+            N = len(arr)
+            dominant = [-1] * N
+            dominant_track = sortedcontainers.SortedList()
+            cnt = collections.Counter()
+            for i in range(N):
+                dominant_track.discard((cnt[arr[i]], arr[i]))
+                cnt[arr[i]] += 1
+                dominant_track.add((cnt[arr[i]], arr[i]))
+                if dominant_track[-1][0] > ((i + 1) // 2):
+                    dominant[i] = dominant_track[-1][1]
+
+            return dominant
+
+        dominant_ltr = get_dominant(nums)
+        dominant_rtl = get_dominant(list(reversed(nums)))
+        dominant_rtl.reverse()
+        N = len(nums)
+
+        for i in range(N - 1):
+            if dominant_ltr[i] == dominant_rtl[i + 1] and dominant_ltr[i] >= 0:
+                return i
+        return -1
+
+
+# leetcode submit region end(Prohibit modification and deletion)
+
+
+class MinimumIndexOfAValidSplit(Solution):
+    pass

main.py

@@ -1,5 +1,4 @@
-from leetcode.editor.en.Q3169.CountDaysWithoutMeetings import CountDaysWithoutMeetings
+from leetcode.editor.en.Q2873.MaximumValueOfAnOrderedTripletI import MaximumValueOfAnOrderedTripletI
 
 if __name__ == '__main__':
-    print(CountDaysWithoutMeetings().countDays(8,
-                                               [[2, 3], [3, 5], [8, 8]]))
+    print(MaximumValueOfAnOrderedTripletI().maximumTripletValue([5, 7, 8, 4]))