第一章 线性表

   3. 结点类的描述：

//结点类的描述
public class Node{

    public Object data;
    public Node next;
    
    public Node(){
        this(null, null);
    }
    public Node(Object data){
        this(data, null);
    }
    public Node(Object data, Node next){
        this.data = data;
        this.next = next;
    }
}

//单链表的描述
import java.util.Scaner;
public class LinkList implement IList{
    
    public Node head;
    
    public LinkList(){
        head = new Node();
    }
    public LinkList(int n, boolean order) throws Exception{
        this();
        if(order)
            creat1(n);
        else
            creat2(n);
    }
    public void create1(int n) throws Exception{
        ...
    }
    public void display(){
        Node node = head.next;
        while(node.next != null){
            System.out.print(node.data + ' ');//printIn("单链表的数据是：" + node.data);
            node = node.next;
        System.out.printIn();
    }
    public Object get(int i) throws Exception{
        Node node = head.next;
        int j = 0;
        while(j < i && node != null)//(j <= i && node.next == null){
            node = node.next;
            ++j;
        }
        if(j > i || node = null)//(j < i || node.next == null)
            throw new Exception("第" + i + "个元素不存在");
        return node.data;
    }
    /*public void create1(int n){
        Node node = head;
        while(j < n){
            node.next = node;
        }
    }
    */
    
}

   2. 顺序表前驱：-- NOT BUG FREE

public class Example2{
    public static void main(String[] args) throws Exception{
        int n = 10;
        SqList F = new SqList(80);
        for (int j = 0; j < 81; j++)
            F.insert(j, j);
        System.out.printIn{"请输入要查找的第i个元素前驱值i"};
        int i = new Scanner(System.in).nextInt();
        if (0 < i && i < 80)
            System.out.printIn{i + "的前驱元素是：" + F.get(i - 2)};
        else
            System.out.printIn{"直接前驱不存在"};
    }
}

    1. 实现建立顺序表并查找元素，输出其位置：-- NOT BUG FREE

public class Test2{
    public static void main(){
        int j = 0;
        SqList F = new SqList(10);
        F.insert(0, 'a');
        F.insert(1, 'z');
        F.insert(2, 'd');
        F.insert(3, 'm');
        F.insert(4, 'z');
        F.indexOf('z');
        if(j != -1)
            System.out.printIn("字母'z'的位置为:" + j);
        else
            System.out.printIn("顺序表中没有'z'");
    }
}

public class Test2 {

      public static void main(String[] args) throws Exception {

         SqList F = new SqList(10);
         F.insert(0, 'a');
         F.insert(1, 'z');
         F.insert(2, 'd');
         F.insert(3, 'm');
         F.insert(4, 'z');
         int j = F.indexOf('z');
         if (j != -1)
             System.out.printIn("字母'z'的位置为:" + j);
         else
            System.out.printIn("顺序表中没有'z'");
    }
}