JAVA数据结构算法复习

public void remove(int i) throws Exception {Node p &＃61; head; //初始化p指向头结点&＃xff0c;j为计数器int j &＃61; -1;while(p.next !&＃61; null && j i-1 || p.next &＃61;&＃61; null){throw new Exception("删除位置不合法"); //修改指针&＃xff0c;使待删除结点从单链表中脱离出来p.next &＃61; p.next.next;
}

3.3求链栈的长度操作算法

public int length() {Node p &＃61; top; //初始化&＃xff0c;p指向栈顶元素&＃xff0c;length为计数器int length &＃61; 0; while (p !&＃61; null) { //从栈顶元素向后查找&＃xff0c;直到p指向空p &＃61; p.next; //p指向后继结点&＃43;&＃43;length; //长度加1}return length;
}

3.4链栈的入栈操作算法

public void push(Object x) {Node p &＃61; new Node(x); //构造一个新结点p.next &＃61; top;top &＃61; p; //新结点成为当前的栈顶结点
}

3.5链栈的出栈操作算法

public Object pop() {if (isEmpty()) {return null;}else {Node p &＃61; top; //p指向被删结点&＃xff08;栈顶结点&＃xff09;top &＃61; top.next; //修改链指针&＃xff0c;使栈顶结点从链栈中移去return p.data; //返回栈顶结点的数据域的值}
}

3.6循环顺序队列的入队操作算法

public void offer(Object x) throws Exception{if ((rear &＃43; 1) % queueElem.length &＃61;&＃61; front) //队列满throw new Exception("队列已满"); //抛出异常else {queueElem[rear] &＃61; x;//x存入rear所指的数组存储位置中&＃xff0c;使其成为新的队尾元素rear &＃61; (rear &＃43; 1) % queueElem.length; //修改队尾指针
}

3.8 链队列的入队操作算法

public void offer(Object x) {Node p &＃61; new Node(x); //初始化队列新结点if (front !&＃61; null){ //队列非空rear.next &＃61; p;rear &＃61; p; //改变队尾的位置}elsefront &＃61; rear &＃61; p;
}

链队列出队poll&＃xff08;&＃xff09;方法的实现

public Object poll(){if (front !&＃61; null) { //队列非空Node p &＃61; front; //p指向队首节点front &＃61; front.next; //队首节点出列if (p &＃61;&＃61; rear) //被删除的结点是队尾结点时rear &＃61; null;return p.data; //返回队首节点的数据域值}elsereturn null;
}