C++Primer Plus递归一节中尺子程序的另一种写法

#include<iostream>
using namespace std;
const int N=5;
int count(int a);
void due(int len,int le,char*b);
int main()
{
	int len=count(N);
	int le=len;
	char ruler[len+1];
	for(int j=0;j<len;++j) ruler[j]=' ';
	ruler[len]='\0';
	ruler[len-1]='|';
	ruler[0]='|';
	cout<<ruler<<endl;
	le=len-1;
	for(int i=1;i<=N;++i)
	{
		le=le/2;
		due(len,le,ruler);
	}
	return 0;
}

int count(int a)
{
	int ans=3;
	for(int i=1;i<a;++i) ans=ans*2-1;
	cout<<ans<<endl;
	return ans;
}

void due(int len,int le,char* b)
{
	int i=0;
	while(i<=(len-1)/le)
	{
		b[i*le]='|';
		++i;
	}
	cout<<b<<endl;
}

By little_small_joze and Katlynn 网络加速 Kiwimini.net