zoukankan      html  css  js  c++  java
  • java链表

    package com.phz.test1;

    public class Link {
    class Node{
    private String data;
    private Node next;
    public Node(String data){
    this.data = data;
    }
    //添加节点
    public void add(Node newNode){
    if(this.next==null)this.next=newNode;
    else this.next.add(newNode);
    }
    //打印节点
    public void print(){
    System.out.print(this.data+" ");
    if(this.next!=null)this.next.print();
    }
    //查询节点
    public boolean search(String data){
    if(data.equals(this.data))return true;
    else {
    if(this.next!=null)return this.next.search(data);
    else return false;
    }
    }
    //删除节点
    public void delete(Node previous,String data){
    if(data.equals(this.data))previous.next = this.next;
    else{
    if(this.next!=null)this.next.delete(this, data);
    }
    }
    }//Node
    private Node root;
    public void addNode(String data){
    Node newNode = new Node(data);
    if(this.root==null)this.root=newNode;
    else this.root.add(newNode);
    }
    public void printNode(){
    if(this.root!=null)this.root.print();
    }
    public boolean contains(String name){
    return this.root.search(name);
    }
    public void deleteNode(String data){
    if(this.contains(data)){
    if(this.root.data.equals(data))this.root = this.root.next;
    else this.root.next.delete(root, data);
    }
    }

    //test main
    public static void main(String[] args) {
    Link l = new Link();
    l.addNode("A");
    l.addNode("B");
    l.addNode("C");
    l.addNode("D");
    l.addNode("E");
    l.printNode();
    l.deleteNode("C");
    System.out.println();
    l.printNode();
    System.out.println("查询节点:"+l.contains("A"));
    }
    }//Link

  • 相关阅读:
    hdu 1712(分组背包)
    hdu 3033(好题,分组背包)
    阶乘除法(很久之前的一道题,感觉挺好的,遂记录之)
    hdu 1559(最大子矩阵)
    hdu 1080(LCS变形)
    POJ 3458 Colour Sequence
    HUST 1599 Multiple
    HDU 3903 Trigonometric Function
    HUST 1605 Gene recombination
    UVA 11551 Experienced Endeavour
  • 原文地址:https://www.cnblogs.com/geryhz/p/14304409.html
Copyright © 2011-2022 走看看