oj
is2120
这个作者很懒,什么都没留下…
展开
-
lintcode 508.Wiggle Sort
题目:LintCode 508. 摆动排序给你一个没有排序的数组,请将原数组就地重新排列满足如下性质nums[0] <= nums[1] >= nums[2] <= nums[3]....方案: 1 class Solution { 2 public: 3 /* 4 * @param nums: A list of integers 5 * @re...原创 2018-01-17 00:06:39 · 262 阅读 · 0 评论 -
LeetCode 153. Find Minimum in Rotated Sorted Array
---Q:Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find the minimum element.You may assume no duplicate...原创 2018-03-17 07:30:10 · 291 阅读 · 0 评论 -
LeetCode.25 Reverse Nodes in k-Group
写得不简洁,1h。总结一个清晰简洁的版本。class Solution{public: void reversList(ListNode* head, ListNode* tail, ListNode* prev_sec_tail, ListNode* next_sec_head) { if (!head) { return; } ListNode* head...原创 2018-08-16 17:00:23 · 226 阅读 · 0 评论