美团一面

1.交换左右子树

void SwapChild(Tree T)
{
	Tree Tmp;

	if(T != NULL || T->Left == NULL && T->Right == NULL)
			return;
	SwapChild(T->Left);
	SwapChild(T->Right);
	Tmp = T->Left;
	T->Left = T->Right;
	T->Right = Tmp;
}

2. 梯度计费问题(1T=1000G)

流量	价格
0-200G	0.5
200G-2T	0.45
2T-20T	0.4
20T-200T	0.35
200T以上	0.3

#define N 5
double flow[N] = { 0, 200, 2000, 20000, 200000 };
double price[N+1] = { 0, 0.5, 0.45, 0.4, 0.35, 0.3 };

double totalprice(double n)
{
	double sum = 0.0, tmp;
	int i = 1;

	while(i < N && n >= flow[i])
	{
		tmp = flow[i] - flow[i-1];
		sum += tmp * price[i];
		i++;
	}
	tmp = n - flow[i-1];
	sum += tmp * price[i];
	return sum;
}