搜索资源列表
给定n 位正整数a，去掉其中任意k≤n 个数字后
- 给定n 位正整数a，去掉其中任意k≤n 个数字后，剩下的数字按原次序排列组成一个新的正整数。对于给定的n位正整数a 和正整数k，设计一个算法找出剩下数字组成的新数最小的删数方案。 对于给定的正整数a，编程计算删去k个数字后得到的最小数。 ,Given n-bit positive integer a, which removed any k ≤ n digits, the remaining number of the original order to form a new po
sliding
- 求出sliding window的最大最小值-n array of size n ≤ 106 is given to you. There is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window. Each time the sliding window moves ri
95302915Classify_Homework
- 模式识别k均值算法，用于求大量非线性复杂问题的一种比较好的方法-Pattern Recognition k means algorithm, for a large number of non-linear complex problems demand a better method
113172251k_Mean
- 模式识别k均值算法，用于求大量非线性复杂问题的一种比较好的方法-Pattern Recognition k means algorithm, for a large number of non-linear complex problems demand a better method
topK
- 计算topk 数组的最小的k个数,已经使用stl nth_element-calculat the topl
sort
- 利用堆排序的思想，使用C++模板类，对数组进行排序，输出最大或最小的k个数。-The use of heap sort of thinking, using C++ template class, sort the array, the output of the maximum or minimum number of k.