sinat_26916859的博客

输入一个单向链表，输出该链表中倒数第k个结点，链表的倒数第0个结点为链表的尾指针。链表结点定义如下：struct ListNode{      int       m_nKey;      ListNode* m_pNext;};详细描述：接口说明原型：ListNode* FindKthToTail(ListNode*

#include #include using namespace std; void filter(string str) { //各字符串的下标即为其对应的阿拉伯数字 char *ch[]={"Ling","Yi","Er","San","Si","Wu","Liu","Qi","Ba","Jiu"}; int a=0;//存储数字 int i,j=1,k

描述写出一个程序，接受一个十六进制的数值字符串，输出该数值的十进制字符串。知识点字符串,循环,函数,指针运行时间限制10M内存限制128输入输入一个十六进制的数值字符串。输出输出该数值的十进制字符串。样例输入0xA

#include#include using namespace std;int main(){string str;cin>>str;int len = str.size();int NumOfChar;for (int i =0; i{NumOfChar = 1;int j = i+1;if (j {while( j{

#include #include using namespace std; int Getlen(int *array, int size){ int j =0,cnt =0; while(j<size) { if (array[j++] >=0) { ++cnt; } } return cnt;}int main(){ string str;

#includeusing namespace std;int main(){ int small,big; cin>>small>>big; int MinPerfectNum = 30;//2*3*5 int PerfectNum = 30; int NumOfPerfectNum = 0; for(; PerfectNum >= small && Perf

#include#include #include using namespace std;int main(){ int n; int ouputNum; char str[50]; char ch; char output[50]; string line; cin>>line; n= line[0]; for(int i = 2; i