Solved

How do I get this to work?

Posted on 2007-11-23
3
193 Views
Last Modified: 2013-11-23
I can't seem to get this to work. I keep getting the same error message... invalid method declaration; return type required...

Can anyone help?  

Also, will this code really work?
public class PQFinal extends MinHeap
{
  private Comparable[] theHeap;
  private int elems;
  private int cap = 10;
  private int priority;
  private int size;
  
  public static String MyPriorityQueue(int n)
  {
    Comparable[] arr = new Comparable[size];
    elems = 0;
    priority = 1;
  }
  
  public static String MyPriorityQueue()
  {
    Comparable[] arr = new Comparable[cap];
    priority = 1;
    elems = 0;
  }
  
  public boolean isFull()
  {
    if(elems == cap)
      return true;
    else
      return false;
  }
  
  public boolean isEmpty()
  {
    if(elems == 0)
      return true;
    else
      return false;
  }
  
  public boolean enqueue(Comparable o)
  {
  
  }
  
  public Object dequeue()
  {
    Object o = new Object();
    return o;
  }
  
  public static String MyMinHeap()
  {
    cap = 10;
    size = 0;
    theHeap = new Comparable[10];
  }
  
  public MyMinHeap(Comparable[] arr, int n)
  {
    size = n;
    cap = arr.length;
    theHeap = arr;
      return size;
  }
  
  public int getSize()
  {
    if(size != 0)
      return theHeap;
    return -1;
  }
  
  public boolean add(Comparable o)
  {
    if (o == null)
      throw new IlegalArgumentException();
      
    if(size >= theHeap.length - 1)
      theHeap = resize(elem);
      
    size++;
    theHeap[size] = o;
  }
  
  public Object removeMin()
  {
    if(size <= 0)
      return -1;
    swap(1, size--);
    shiftDown(1);
    return theHeap[size];
  }
  
  private void shiftDown(int index)
  {
    int lc = leftChild(i);
    int rc = rightChild(i);
    if(lc < size)
    {
      if((rc < size) && (theHeap[rc] > theHeap[lc]))
        lc = rc;
      if(theHeap[i] < theHeap[lc])
      {
        swap(i, lc);
        shiftDown(lc);
      }
    }
  }
  
  private void buildHeap()
  {
    for(int i = size; i >= 0; i++)
      shiftDown(i);
  }
  
  public void parseInts()
  {
    return data.parseInts();
  }
  
  public void parseStrings()
  {
    return data.parseStrings();
  }
}

Open in new window

0
Comment
Question by:javalurnin
3 Comments
 
LVL 143

Expert Comment

by:Guy Hengel [angelIII / a3]
ID: 20340314
 public MyMinHeap(Comparable[] arr, int n)

needs to be

  public void MyMinHeap(Comparable[] arr, int n)
0
 
LVL 7

Expert Comment

by:UrosVidojevic
ID: 20340327
 public PQFinal(Comparable[] arr, int n)
  {
    size = n;
    cap = arr.length;
    theHeap = arr;
      return size;
  }

If you wanted this method to be constructor...
0
 
LVL 92

Accepted Solution

by:
objects earned 250 total points
ID: 20340782
>  public boolean enqueue(Comparable o)
>  {

>  }

looks like that should be:

  public boolean enqueue(Comparable o)
  {
         return add(o);  
  }
0

Featured Post

Free Tool: Path Explorer

An intuitive utility to help find the CSS path to UI elements on a webpage. These paths are used frequently in a variety of front-end development and QA automation tasks.

One of a set of tools we're offering as a way of saying thank you for being a part of the community.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Suggested Solutions

Java functions are among the best things for programmers to work with as Java sites can be very easy to read and prepare. Java especially simplifies many processes in the coding industry as it helps integrate many forms of technology and different d…
A short article about problems I had with the new location API and permissions in Marshmallow
Viewers will learn about arithmetic and Boolean expressions in Java and the logical operators used to create Boolean expressions. We will cover the symbols used for arithmetic expressions and define each logical operator and how to use them in Boole…

820 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question