int main(int argc, char const *argv[]) { // TestQueue(); int Numbers[] = {1, 3, -1, -3, 5, 3, 6, 7}; int Len, i, k, ReturnSize; int *Result; Len = sizeof(Numbers) / sizeof(Numbers[0]); // HeapSort(Numbers, Len); // for (i = 0; i < Len; ++i) // printf("%d ", Numbers[i]); // printf("\n"); // ElementType* Heap; // Heap = InitHeap(Numbers, Len); // BuildHeap(Heap, Len); // for (i = 1; i < Len; ++i) // printf("%d ", Heap[i] -> Value); k = Len; Result = maxSlidingWindow(Numbers, Len, k, &ReturnSize); printf("%d\n", ReturnSize); for (i = 0; i < ReturnSize; ++i) printf("%d ", Result[i]); printf("\n"); return 0; }
int main() { std::vector<int> nums; nums.push_back(1); nums.push_back(3); nums.push_back(-1); nums.push_back(-3); nums.push_back(5); nums.push_back(3); nums.push_back(6); nums.push_back(7); std::vector<int> results = maxSlidingWindow(nums, 3); printQueue(results); return 1; }