用递归实现厄密函数

<span style="font-size:18px;">#include <stdio.h>int hermite(int n,int x){if(n<=0)return 1;else if(n=1)return 2*x;elsereturn 2 * x *(hermite(n-1,x))-2*(n-1)*(hermite(n-2,x));}int main(){int ret=0;ret=hermite(1,2);printf("%d\n",ret);return 0;}</span>