【Data Structure Array: Maximum of all subarrays of size k】的更多相关文章

Data Structure Array: Maximum of all subarrays of size k

http://www.geeksforgeeks.org/maximum-of-all-subarrays-of-size-k/ #include <iostream> #include <vector> #include <algorithm> #include <queue> #include <stack> #include <string> #include <fstream> #include <map&g…

Data Structure Array: Maximum circular subarray sum

http://www.geeksforgeeks.org/maximum-contiguous-circular-sum/ #include <iostream> #include <vector> #include <algorithm> #include <queue> #include <stack> #include <string> #include <fstream> #include <map>…

Data Structure Array: Maximum sum such that no two elements are adjacent

http://www.geeksforgeeks.org/maximum-sum-such-that-no-two-elements-are-adjacent/ #include <iostream> #include <vector> #include <algorithm> #include <queue> #include <stack> #include <string> #include <fstream> #i…

Data Structure Array: Given an array arr[], find the maximum j – i such that arr[j] > arr[i]

http://www.geeksforgeeks.org/given-an-array-arr-find-the-maximum-j-i-such-that-arrj-arri/ #include <iostream> #include <vector> #include <algorithm> #include <queue> #include <stack> #include <string> #include <fstre…

Data Structure Array: Find the Missing Number

http://www.geeksforgeeks.org/find-the-missing-number/ 1. use sum formula, O(n), O(1) 2. use XOR, O(n), O(1) 3. use counting sort, O(n), O(1), changing the array 4. use negtive, O(n), O(1), chaning the array #include <iostream> #include <vector>…

Data Structure Array: Move all zeroes to end of array

http://www.geeksforgeeks.org/move-zeroes-end-array/ #include <iostream> #include <vector> #include <algorithm> #include <queue> #include <stack> #include <string> #include <fstream> #include <map> #include &…

Data Structure Array: Find if there is a subarray with 0 sum

http://www.geeksforgeeks.org/find-if-there-is-a-subarray-with-0-sum/ #include <iostream> #include <vector> #include <algorithm> #include <queue> #include <stack> #include <string> #include <fstream> #include <m…

Data Structure Array: Given an array of of size n and a number k, find all elements that appear more than n/k times

http://www.geeksforgeeks.org/given-an-array-of-of-size-n-finds-all-the-elements-that-appear-more-than-nk-times/ 这一题如果没空间要求就没那么麻烦了 #include <iostream> #include <vector> #include <algorithm> #include <queue> #include <stack> #i…

Data Structure Array: Sort elements by frequency

http://www.geeksforgeeks.org/sort-elements-by-frequency-set-2/ #include <iostream> #include <vector> #include <algorithm> #include <queue> #include <stack> #include <string> #include <fstream> #include <map>…

Data Structure Array: Largest subarray with equal number of 0s and 1s

http://www.geeksforgeeks.org/largest-subarray-with-equal-number-of-0s-and-1s/ #include <iostream> #include <vector> #include <algorithm> #include <queue> #include <stack> #include <string> #include <fstream> #incl…