gson 生成的json字串帶\u003c,\u003d,\u003e的解決方案(gson將實體類轉json)
阿新 • • 發佈:2020-11-30
//實驗1
不能,因為函式只能返回一個值
//實驗2
//實驗2 //利用區域性static變數計算階乘 #include<stdio.h> long long fac(int n); //函式宣告 int main(){ int i, n; printf("Enter n:"); scanf("%d", &n); for(i=1; i<=n; ++i) printf("%d!=%lld\n", i, fac(i)); return 0; } //函式定義 long long fac(intn) { static long long p = 1; //在第二次被呼叫時能保持第一次被呼叫的值 printf("p = %lld\n", p); p = p*n; return p; }
//實驗2-2 //練習:區域性static變數特性 #include<stdio.h> int func(int, int); int main(){ int k=4,m=1,p1,p2; p1 = func(k,m); p2 = func(k,m); printf("%d,%d\n",p1,p2); return 0; } int func(int a,int b){ static int m=0,i=2; i += m+1; m = i+a+b; return (m); }
static變數在後一次被呼叫時可以保留前一次被呼叫的值
//實驗3
// 尋找兩個整數之間所有的素數(包括這兩個整數 ),把結果儲存在陣列bb中,函式返回素數的個數 //例如,輸入6和21,則輸出為:7 11 13 17 19. #include<stdio.h> #define N 1000 int fun(int n, intm, int bb[N]) { int i,j,k=0,flag; for(j=n;j<=m;j++) { flag=1; for(i=2;i<j;i++) if(j%i==0) { flag=0; break; } if(flag==1) bb[k++]=j; } return k; } int main(){ int n=0,m=0,i,k,bb[N]; scanf("%d",&n); scanf("%d",&m); for(i=0;i<m-n;i++) bb[i]=0; k=fun(n, m, bb); for(i=0;i<k;i++) printf("%4d",bb[i]); return 0; }
//實驗4
//實驗4 #include<stdio.h> long long fun(int n); int main(){ int n; long long f; while(scanf("%d", &n) != EOF) { f = fun(n); printf("n = %d, f = %lld\n",n,f); } return 0; } long long fun(int n){ if( n<33 && n>0){ int j; long long sum; long long count = 1.0; for(j=0;j<n;j++){ count = count*2; } sum = count - 1; return sum; } else printf("not quadratic equation.\n"); }
//實驗5
//實驗5 #include<stdio.h> void draw(int n, char symbol); #include<stdio.h> int main(){ int n, symbol; while(scanf("%d %c", &n, &symbol) != EOF) { draw(n, symbol); printf("\n"); } return 0; } void draw(int n, char symbol){ int line = 1; int count,c,m; c = line; m = line; for(count=0;count<n;count++){ c = line; while(c<n){ printf(" "); c++; } m = 1; while(m<=2*line-1){ printf("%c",symbol); m++; } printf("\n"); line++; } }