/** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */struct ListNode* removeElements(struct ListNode* head, int val){ struct ListNode* pre
#include <stdio.h>int Fac(int n){ if(n == 1) { return 1; } return n*Fac(n-1);}int main(){ int n = 0; printf("输入一个数，求他的阶乘：\n"); scanf("%d",&n); printf("n的乘是：
#include <stdio.h>int main(){ int i,j,k; int num = 0; scanf("%d",&num); //打印上半 for(i = num; i>=1; i--)//一行 { for(j=1; j<=i-1; j++)//空格 { p
#include <stdio.h>#include <string.h>#include <stdlib.h>//搞完才发现还有空格，不搞了，刷下一个去。int main(){ int count_num = 0, count_en = 0, count_other = 0; char input [100] = {0}
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号
