资源列表
HeapMake
- c++代码，实现堆排序，方法是先建立一个大根堆，然后逐步进行调整-c++ code that implements heap sort, the method is to set up a large root heap, then gradually adjust
PalindromeJudge
- c++代码，代码功能为：判断一个字符串是否为回文串-c++ code, the code for the function: to determine whether a string is a palindrome string
String-All-Permutation
- c++代码，功能为实现字符串的全排列，使用了递归和字典序两种方法-c++ code function to achieve full array of strings, using recursion and lexicographic two ways
templateme
- 通过群体优化算法优化的基于内容的图像检索方法，通俗易懂，非常容易理解。-Through group optimization algorithm optimization method for content-based image retri , user-friendly, very easy to understand and learn.
Josephus
- 解决Josephus的问题，来自于poj上的一个题目。-Josephus solve problems a subject poj on.
ZigZag-Conversion
- Zigzag:即循环对角线结构（ 0 8 16 1 7 9 15 17 2 6 10 14 18 3 5 11 13 19 4 12 20 ） 向下循环:nRows 斜角线循环:nRows-2(减去首尾两个端点) 重复-The string PAYPALISHIRIN
Wiggle-Sort-II
- 对一个数组进行摇摆排序使a1<a2>a3<a4>a5-sort the array in wiggle way
Roman-to-Integer
- 罗马数字转换为阿拉伯数字,整形，小于3-roman invert to the int number
Odd-Even-Linked-List
- 将链表中位置为奇数的数字接到所有位置为偶数的数字后面，且不能改变其相对顺序-Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.
String-to-Integer
- 将一个字符串数字转换为整形数字，并且对不能转换成功的返回错误- Then, starting this character, takes an optional initial plus or minus sign followed by as many numerical digits as possible, and interprets them as a numerical value.
Graph-traversal
- 本代码是数据结构中图的遍历程序，是自己写的，能够直接运行使用-This code is the data structure of the graph traversal process, is written in their own, can be directly used to run
Hierarchical-traversal
- 该算法是数据结构中的层次遍历算法，能够直接运行使用，欢迎下载-The algorithm is the data structure of the hierarchical traversal algorithm, can be directly run to use, welcome to download