Sign in Subscribe

Topic

Sort

A collection of 5 issues

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 &nums, int left, int right) { int pivot = nums[left]

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, 2, 5, 3, 4]. Answer: class Solution { public: /* * @param

Kth Largest Element

Question: http://www.lintcode.com/en/problem/kth-largest-element/ Find K-th largest element in an array. You can swap elements in the array. Answer: class Solution { public: /* * @param n: An integer * @param nums: An array * @return: the Kth largest element */ inline void qsort(vector &nums, int left, int right) { if (left

Find the smallest k elements

Question: Find the smallest k elements Answer: void findkmin(int *array, int len, int k) { int* kmin = new int[k]; if (len <= k) { for (int i = 0; i < len; i++) kmin[i] = array[i]; } else { for (int i = 0; i < len; i++) { int j; for (j = 0; j < ((i < k)

Merge two sorted list

Question: Write a function in C++ to merge two already sorted linked lists, do not use recursion. Given a data structure: class Node { public: int data; Node* next; }; Implement the function: Node* Merge (Node* head1, Node* head2) { … } It takes in two already sorted linked lists (in ascendant order, duplicates allowed)