华为笔试题(1)--地铁最少

华为的笔试题中有个题目如下：

已知2条地铁线路，其中A为环线，B为东西向线路，线路都是双向的。经过的站点名分别如下，两条线交叉的换乘点用T1、T2表示。编写程序，任意输入两个站点名称，输出乘坐地铁最少需要经过的车站数量（含输入的起点和终点，换乘站点只计算一次）。地铁线A（环线）经过车站：A1 A2 A3 A4 A5 A6 A7 A8 A9 T1 A10 A11 A12 A13 T2 A14 A15 A16 A17 A18 地铁线B（直线）经过车站：B1 B2 B3 B4 B5 T1 B6 B7 B8 B9 B10 T2 B11 B12 B13 B14 B15

代码如下：

#include <iostream>
#include <string.h>
char A[20][4]={"A1","A2","A3","A4","A5",
					"A6","A7","A8","A9","T1",
					"A10","A11","A12","A13","T2",
					"A14","A15","A16","A17","A18"};
char B[17][4]={"B1","B2","B3","B4","B5",
					"T1","B6","B7","B8","B9",
					"B10","T2","B11","B12","B13","B14",
					"B15"};
char T1[1][4]={"T1"};
char T2[1][4]={"T2"};
using namespace std;
bool Iseq(char char1[1][4],char char2[1][4])
{
	bool Iseq=1;
	for(int i=0;i<3;i++)
	{
		if(char1[0][i]!=char2[0][i])
			Iseq=0;
	}
	return Iseq;
}
bool Iseq(char char3[1][4],string str)
{
	bool Iseq=1;
	for(int i=0;i<4;i++)
	{
		if(char3[0][i]!=str.at(i))
			Iseq=0;
	}
	return Iseq;
}

int whichsation(char sation[1][4],char *whichway)
{
	int w;
	if(sation[0][0]=='A')
	{
		*whichway='A';
		for(int i=0;i<20;i++)
		{
			if(sa