Quick Sort Wiggle Sort II Question: http://www.lintcode.com/en/problem/wiggle-sort-ii/ Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3].... Answer: class Solution { public: /* * @param nums: A list of integers * @return: nothing */ inline int partion(vector&
Quick Sort Wiggle Sort Question: http://www.lintcode.com/en/problem/wiggle-sort/ Given an unsorted array nums, reorder it in-place such that nums[0] <= nums[1] >= nums[2] <= nums[3].... Example Given nums = [3, 5, 2, 1, 6, 4], one possible answer is [1, 6,
Array Array Right Shift K Steps Question: An array has N numbers, move each elements to right for K steps. time limit : O(N) e.g. abcd1234 move 4 steps turns out 1234abcd Answer: void Reverse(int* arr, int b, int e) { for (; b < e; b++, e--) { int temp
Greedy Maximum Subarray Question: http://www.lintcode.com/en/problem/maximum-subarray/ Given an array of integers, find a contiguous subarray which has the largest sum. Time Complexity: O(n) Answer: void maxsumofsubarray(int* array, int len) { int curMax = 0; int mi = -1; int mj = -1; int max;