数据结构：累加和汉诺塔

1.累加

#include<stdio.h>
#include<malloc.h>
int addTo(int n) {
	int sum;
	if (n <=0) {
	    return 0;
	}
	else {
		sum = addTo(n - 1) + n;
		return sum;
	}
}
int main() {
	int sum;
	sum = addTo(5);
	printf("%d\r\n", sum);
}

2.汉诺塔

#include <stdio.h>
void hanoi(int n , char A , char B , char C)
{
  if(n == 1)
    printf("%c---->%c\n",A,C);
  else
  {
    hanoi(n-1,A,C,B);
    printf("%c---->%c\n",A,C);
    hanoi(n-1,B,A,C);
  }
}
 
int main()
{
    int n;
    scanf("%d",&n);
  hanoi(n,'A','B','C');
  return 0;
}