搜索资源列表
给定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
handout-files
- SSD5_EXE3练习题 if (!testConstructors()) { cerr << "Constructor and\\or accessors failed check\n" return EXIT_FAILURE } if (!testLessThan()) { cerr << "Operator < failed check\n" return EXIT_FAILURE } i
STL_YSFH2
- 用stl模板实现雅瑟夫环，n个人站成一圈，每次数到第m个，该人退出，最后剩下的人的编号-Ya Sefu ring with stl templates, n individuals stand in a circle, each number to m a, the person quit, the last remaining number of people
avl-array-CPP-1.2.1
- AVL Array 是一个C++风格的容器类，具有快速随机存取和任意位置快速插入、删除的功能。-AVL Array is a C++ STL-style container with fast random access _and_ fast insert/erase at any point (all are O(log N) worst case)
SingleLinkSort
- 使用Visual C++，其实是用了STL了，实现单链表的排序，通过采用分治法，使得时间为O(n*log(n))，空间复杂度O(n)。-Sort of Single Link List
tree-2.81.tar
- 一个通用的STL风格的N叉树实现，高效稳定-A generic STL-N-tree implementation, efficient and stable
Max-Points-on-a-Line
- leetcode中求最大共线的点的数量，题目leetcode上有-Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.
NumberOf1Between1andN
- 从1到n整数中1出现的次数，Occurrence of 1 from the number 1 to n-Occurrence of 1 from the number 1 to n
全排列
- 实现输入N个数字，N个数字全排列输出 并存放到二维数组中。(Achieve input N numbers, N numbers, all arranged output, and stored in a two-dimensional array.)