使用迭代器返回最大对象在列表中的位置的泛型方法

Question

 public static <T> int max(List<T> list, Comparator<? super T> c)
  {


      if (list == null)
      {
          throw new NoSuchElementException();
      }

      int m = 0; // index max value
      T maxvalue = list[0]; // max value (error: How do it get the value of the list here?)
      int counter = 0;

      Iterator<T> it = new DobbeltLenketListeIterator(); //( error: cannot be referenced from a static context)

      while(it.hasNext()) 
      {
          counter++;

          if (c.compare(it.next(), maxvalue) > 0)
          {
              maxvalue = it.next;

              m = counter;
          }


      }


      return m;

  }

迭代器：

 private class DoublelinkedlistIterator implements Iterator<T>
  {
    private Node<T> p;
    private boolean removeOK;


    private DoublelinkedlistIterator()
    {
      p = head;        
      removeOK = false;  

    }

    public boolean hasNext()
    {

        if(p.next != null )
        {
            return true;
        }

        return false;
    }

    public T next()
    {


      if( hasNext() == false)
      {
        throw new NoSuchElementException();
      }

      Node<T> q = p;

      p = p.next;
      removeOK = true;
      return q.value;


    }

    public void remove()
    {

      if(!removeOK) throw new IllegalStateException("illegal!");

      removeOK = false;
      Node<T> q = head;

      if(head.next == p)
      {
          head = head.next;
          if(p== null) tale = null;
      }
      else
      {
          Node<T> r = head;
          while (r.next.next != p)
          {
              r = r.next;
          }

          q= r.next;
          r.next = p;
          if(p== null) tale = r;
      }

      q.value = null;
      q.value = null;

    }

  }  

  public Iterator<T> iterator()
  {
    return new DoublelinkedlistIterator();
  }

  public Iterator<T> iterator(int index)
  {
      indexcontrol(index);
   Iterator<T> it = new DoublelinkedlistIterator();
      for (int i = 0; i < index && it.hasNext(); i++, it.next()); 
          return it;

  }

Answer 1

>

将内部类标记为静态:

私有静态类DoublelinkedlistIterator实现迭代器

您试图将列表的第一个元素作为数组元素检索。您应该这样写：