小木槌

摘要： public static int lagelangri( int [] sz,int num )//拉格朗日排序法. { int tou =0; int wei=sz.Length-1; int zhong =0; while (tou <=wei) { zhong = tou + (wei - 阅读全文

摘要： public void nizhi()//链表的逆置 { Node T1,T2=head;//head是定义的头结点. T2=head.Next; head.Next=null; while(T2!=null) { T1=T2.Next; T2.Next=head.Next; head.Next=T 阅读全文