幕牧的专栏

题目：n个数，找出其中最小的k个数，写出代码，要求最坏情况下的时间复杂度不能高于O(nlogk)分析：1. 使用最大堆，先压入堆中k个数，以后每一个数与堆顶（当前最大元素）比较，如果更小则替换堆顶。时间复杂度O(klogk + (n-k)logk) = O(nlogk)。注意优先队列的使用方式。如果是最小堆，则 priority_queue, greater >，默认是最大堆prior

写程序输出8皇后问题的所有排列，要求使用非递归的深度优先遍历。测试数据 POJ 2754  http://bailian.openjudge.cn/practice/27541. 递归版本#include #include using namespace std;int answers[100][10];int col[10];int count = 0;bool Va

Next Permutation题目Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lo

[leetcode]20150704b1、N-Queens题目The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to

[leetcode]20150704a5道题