关于C的第一篇博客哟

####这是我写的第一篇博客，欢迎大家浏览，更多更好的技术博客，大家可以关注我哦。希望可以得到更多朋友的赞,谢谢大家的支持!#####]

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
1.求12345
int main() {
int n = 1;
for (int i = 2; i < 6; ++i)
if (i < 6){
n = n*i;
}
printf(“n=%d\n”, n);
system(“pause”);
return 0;
}
2.计算n的阶乘.3.计算1!+2!+3!+…+10!.
int Fac(int n){
int result= 1;
for (int i = 1; i <= n; ++i){
result = i;
}
return result;
}
int main(){
int sum = 0;
for (int i = 1; i<5; ++i){
sum += Fac(i);
}
printf("%d\n",sum);
system(“pause”);
return 0;
}
4.1234递归成1 2 3 4.
void print(int x){
if (x > 9){ //开始递归.
print(x / 10); //一层一层开始.
}
printf("%d ",x % 10);
}
int main(){
print(1234);
system(“pause”);
return 0;
}
5.求字符串的长度.
<1>.循环方式!
int Strlen(char str[]){
int size = 0;
for (int i = 0; str[i] != ‘\0’; ++i){
++size;
}
return size;
}
int main(){
char str[] = “abcd”;
int ret = Strlen(str);
printf(“ret=%d\n”, ret);
system(“pause”);
return 0;
}
<2>递归方式(不允许创建临时变量!)
int Strlen(char str[]){
if (str[0] == ‘\0’){
return 0;
}
return 1 + Strlen(str + 1);
}
int main(){
char str[] = “abcd”;
int ret = Strlen(str);
printf(“ret=%d\n”, ret);
system(“pause”);
return 0;
}
6.求n的阶乘(递归).
int Fac(int n){
if (n == 1){
return 1;
}
return nFac(n - 1);
}
int main(){
int ret = Fac(5);
printf(“ret=%d\n”, ret);
system(“pause”);
return 0;
}
7.求斐波那契数(递归)
<1>.
int Fib(int n){
if (n == 1 || n == 2){
return 1;
}
return Fib(n - 1) + Fib(n - 2);
}
<2>.
int Fib2(int n, int last2, int last1){
if (n == 1 || n == 2){
return 1;
}
return Fib2(n - 1, last1, last2 + last1);
}
int main(){
int ret = Fib2(40,1,1);
printf(“ret=%d\n”,ret);
system(“pause”);
return 0;
}