leetcode
xiaoza7
这个作者很懒,什么都没留下…
展开
-
LeetCode 1235. Maximum Profit in Job Scheduling
//dp+二分 int n = startTime.size(); vector<vector<int>> jobs(n); for (int i = 0; i < n; i++) { jobs[i].push_back(startTime[i]); jobs[i].pu...原创 2019-11-11 16:10:28 · 200 阅读 · 0 评论 -
leetcode-80. Remove Duplicates from Sorted Array II
Given a sorted arraynums, remove the duplicatesin-placesuch that duplicates appeared at mosttwiceand return the new length.Do not allocate extra space for another array, you must do this bymod...原创 2019-06-04 10:12:06 · 90 阅读 · 0 评论 -
239. Sliding Window Maximum
滑动k-窗口最大值,考虑使用最大堆,java中优先级队列PriorityQueue是最小堆实现,可以借助实现,关于 PriorityQueue可查其他资料。class Solution { public int[] maxSlidingWindow(int[] nums, int k) { if (k<=0) return new int[0]; ...转载 2019-06-18 14:20:44 · 66 阅读 · 0 评论