public void LinkNode(char ch, double op)
{
Node p = this.first;
for (int i = 1; i <= this.length; i++)
{
p = p.link;
}
p = p.InsertAfter(ch, op);
this.length += 1;
}
public int Modify(List <String> list)
{
char ch;
double op;
String str = "";
foreach (String i in list)
{
str += i;
}
String[] tempList = str.Split(new char[] { ',' });
List <String> strList = new List <string>(); //排除切片后存在空字符串的情况
foreach (String i in tempList)
{
if (!(i == ""))
{
strList.Add(i);
}
}
Node p = this.first;
int length = strList.Count;
for (int i = 0; i < length; i++)
{
String str_2 = strList[i];
if (strList[i].Length == 1 && (Convert.ToChar(strList[i]) < 48 || Convert.ToChar(strList[i]) > 57)) //不是数字
{
ch = Convert.ToChar(strList[i]);
switch (ch)
{
case '+':
case '-':
case '*':
case '/':
case '%':
case '^':
case '(':
case ')':
p = p.InsertAfter(ch, 0);
break;
case 'a':
p = p.InsertAfter('^', 0);
p = p.InsertAfter('\0', 2.0);
this.length++;
break;
case 'b':
p = p.InsertAfter('^', 0);
p = p.InsertAfter('\0', 3.0);
this.length++;
break;
case 'c':
p = p.InsertAfter('^', 0);
p = p.InsertAfter('\0', 0.5);
this.length++;
break;
case '!':
p = p.InsertAfter('!', 0);
p = p.InsertAfter('\0', 0);
this.length++;
break;
}
}
else
{
op = Convert.ToDouble(strList[i]);
p = p.InsertAfter('\0', op);
}
this.length++;
}
return(this.length);
}