算法第四版 1.3.40(前移编码)

最新推荐文章于 2019-09-05 20:24:33 发布

原创最新推荐文章于 2019-09-05 20:24:33 发布 · 1.1k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #前移编码 #算法第四版 #算法第四版习题

算法第四版专栏收录该内容

12 篇文章

订阅专栏

本文介绍了一个名为MoveToFont的Java类实现，该类使用链表来存储和操作字符串数据，并提供移除重复项的功能。通过遍历链表并检查每个节点的数据，确保链表中不包含重复元素。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

MoveToFont.java


public class MoveToFont {
    private class Node
    {
        Node next = null;
        String data;
    }
    Node head = null;
    private boolean isRepeat(String s)
    {
        if (head == null)
            return false;
        Node current = head;
        while (current.next != null)
        {
            if (current.next.data.equals(s))
            {
                current.next = current.next.next;
                return true;
            }
            current = current.next; 
        }
        return false;
    }
    public MoveToFont()
    {
        String[] a = {"1","2","3","4","1","3","4","5"};
        for (int i = 0; i < a.length; ++i)
        {
            String s = a[i];
            isRepeat(s);
            if (head == null)
            {
                head = new Node();
                head.data = s;
            }
            else
            {
                Node current = new Node();
                current.data = s;
                current.next = head;
                head = current;
            }
        }
    }
    public String toString()
    {
        String ret = "";
        if (head == null)
            return ret;
        Node current = head;
        ret = head.data;
        while (current.next != null)
        {
            ret = ret + " " + current.next.data;
            current = current.next;
        }
        return ret;
    }
}

main.java

import edu.princeton.cs.algs4.StdOut;

public class Main {
    public static void main(String[] args)
    {
        MoveToFont mtf = new MoveToFont();
        StdOut.print(mtf);
        //StdOut.print("3333");
    }
}

这里写图片描述