java - Java 中的链表节点

Question

我正在尝试将 C# 代码转换为 Java。除了 if 条件中的三行，我几乎已经转换了所有内容。

C#代码

LinkedList<T> buk = new LinkedList();
LinkedListNode<T> current = buk.First;
LinkedListNode<T> previous = null;
if (fooCondition) {
    previous = current.Previous;
} else {
    previous = current;
    current = current.Next;
}

等价的Java代码

LinkedList<T> buk = new LinkedList<>();
T current = buckets.getFirst();
T previous = null;
if (fooCondition) {
    ?                   //previous = current.Previous;  
} else {
    ?                   //previous = current;
    ?                   //current = current.Next;
}

由于 Java 中没有 LinkedListNode 类，任何人都可以建议什么是 Java 中的等效代码吗？

编辑

看起来完整的代码对于获得帮助很重要。这是来自 link 的 C# 函数

  protected void MergeBuckets()
    {
        LinkedListNode<Bucket> current = buckets.First;
        LinkedListNode<Bucket> previous = null;

        int k = (int)Math.Ceiling(1 / epsilon);             // k=1/eps as integer
        int kDiv2Add2 = (int)(Math.Ceiling(0.5 * k) + 2);   // k/2 as integer
        // at this point 1/k <= eps, k >= 2, hence requires eps >= 0.5

        // number of concecutive buckets with same count causing a 
        // merge of the oldest two of those buckets
        int numberOfSameCount = 0;

        // traverse buckets from first to last, hence in order of 
        // descending timestamp and ascending count
        while (current != null)
        {
            // previous and current bucket have same count, increment counter
            if (previous != null && previous.Value.Count == current.Value.Count)
                numberOfSameCount++;
            // current is first with that count, reset counter to 1
            else
                numberOfSameCount = 1;

            // detect need for a merge
            if (numberOfSameCount == kDiv2Add2)
            {
                // merge buckets into current and remove previous
                current.Value.Timestamp = previous.Value.Timestamp;                 // take most recent timestamp
                current.Value.Count = previous.Value.Count + current.Value.Count;   // sum the counts of the buckets, 
                                                                                    // i.e. next power of two

                buckets.Remove(previous);

                // note that a merged bucket might cause a cascade of merges due to its new count,
                // hence the new current node should point to the merged bucket otherwise the 
                // cascade might go unnoticed, temporarily violating the invariant!

                previous = current.Previous;    // merged bucket's previous, since old previous is removed
                //current = current;            // trivial, merged bucket is new current

                // at this iteration, the traversal stays in place
            }
            // no merge required, continue normally
            else
            {
                previous = current;         // old current bucket or merged bucket
                current = current.Next;     // current's or merged's next

                // at this iteration, the traversal moves to the next (older) bucket
            }
        }
    }

Answer 1

难道不能使用LinkedList提供的listIterator，并使用其提供的方法来浏览Linked List吗

ListIterator<T> listIterator = linkedListNode.listIterator(0);
if(yourCondition && listIterator.hasNext()){
    T next = listIterator.next();
}
else if (listIterator.hasPrevious()){
    T previous = listIterator.previous();
}

希望对你有帮助