搜索资源列表
8-classical-algorithm-c-language
- 1.实现将输入的string字符串反序输出。 2.一个数如果恰好等于它的因子之和，这个数就称为"完数"。例如6 = 1+2+3找出10000以内的所有完数。 3.下面程序的功能是将一个4×4的数组进行逆时针旋转90度后输出，要求原始数组的数据随机输入，新数组以4行4列的方式输出 4.编程打印杨辉三角。 5.实现将输入的字符串反序输出 6.实现字符串拷贝函数strcopy(char*src,char* dest) 7.求近似Pi值。可以用公式（如：pi/2 = 1+1/3+
_Palindrom1544822152003
- Palindrome Application developed in C-Palindrome Application developed in C++
palindr
- algorithm recursive checks a word is palindrome em c language
the-longest-palindrome-substring
- 对于给定的一个字符串，求出其中最长的回文子串。其中子串的含义是：在原串中连续出现的字符串片段。本算法采用C++编程，一定是你不错的选择！-For a given string,we should find the longest palindrome substring. Which means that the substring: string fragment in the original string of consecutive. The algorithm uses the C++
palindrome_partitioning
- Palindrome partitioning problem implementation in c++. One of the fundamental problems in Dynamic Programming.
xunzhaohuiwenshu
- c语言课程设计，寻找回文数程序，包含了文件的读写操作-c language curriculum design, look for palindrome programs, including the operation of reading and writing files