0

发生这种情况是否有特殊原因,或者可能有很多不同的原因?我不知道为什么我的程序打印出它正在打印的值,因为我希望它打印出整数。相反,我得到了这个:

循环@173a10f 循环@a62fc3 循环@a62fc3 循环@a62fc3 循环@530daa 循环@a62fc3 循环@a62fc3 循环@530daa 循环@a62fc3

这是代码的一部分:(我还有一个循环类,以及一个堆栈和队列类)

  import java.io.*;
   import java.util.*;

public class PrintQ {

  public static void main(String args[]) throws FileNotFoundException {

     Scanner inFile = new Scanner(new FileReader("C:\\Users\\Whitney\\Desktop\\QueueIn.txt"));
     String job1;
     job1=inFile.next();

     char char1;
     int i=0;
     int FirstComma;
     int SecondComma;
     String charholder;

     QueueClass<cycle> list= new QueueClass(100);
     QueueClass<Integer> cyclelist= new QueueClass(100);
     cycle currentcycle= new cycle();
     cycle priorityCycle= new cycle();
     cycle Scycle= new cycle();


     while(inFile.hasNext()){

        switch(job1.charAt(0)) {

           case 'q': 
              {
                 FirstComma=job1.indexOf(',');
                 SecondComma=job1.lastIndexOf(',');
                 currentcycle.jobNumber=Integer.parseInt(job1.substring(FirstComma+1,SecondComma));
                 currentcycle.cycleNumber=Integer.parseInt(job1.substring(SecondComma+1));
                 cyclelist.addQueue(currentcycle.cycleNumber);
                 list.addQueue(currentcycle);  
                 break;
              }

           case 'p': 
              {                    
                 FirstComma=job1.indexOf(',');
                 SecondComma=job1.lastIndexOf(',');
                 priorityCycle.jobNumber=Integer.parseInt(job1.substring(FirstComma+1,SecondComma));
                 priorityCycle.cycleNumber=Integer.parseInt(job1.substring(SecondComma+1));
                 cyclelist.addQueue(priorityCycle.cycleNumber);
                 list.priorityinsert(priorityCycle);
                 break;
              }

           case 's': 
              {
                 FirstComma=job1.indexOf(',');
                 SecondComma=job1.lastIndexOf(','); 
                 Scycle.cycleNumber=Integer.parseInt(job1.substring(SecondComma+1));
                 list.addQueue(Scycle);
                 cyclelist.addQueue(Scycle.cycleNumber);
                 break;
              }

           case 'h': 
              {
                 StackClass<Integer> stackjob= new StackClass();
                 StackClass<Integer> stackcycle= new StackClass();
                 job1=(String) inFile.next();

                 while(inFile.hasNext()){

                    switch(job1.charAt(0)) {

                       case 'q':
                          {
                             FirstComma=job1.indexOf(',');
                             SecondComma=job1.lastIndexOf(',');
                             currentcycle.jobNumber=Integer.parseInt(job1.substring(FirstComma+1,SecondComma));
                             currentcycle.cycleNumber=Integer.parseInt(job1.substring(SecondComma+1));
                             stackjob.push(currentcycle.jobNumber);
                             stackcycle.push(currentcycle.cycleNumber);
                             break;
                          }
                       case 'p':
                          {
                             FirstComma=job1.indexOf(',');
                             SecondComma=job1.lastIndexOf(',');
                             priorityCycle.jobNumber=Integer.parseInt(job1.substring(FirstComma+1,SecondComma));
                             priorityCycle.cycleNumber=Integer.parseInt(job1.substring(SecondComma+1));
                             stackjob.push(priorityCycle.jobNumber);
                             stackcycle.push(priorityCycle.cycleNumber);
                             break;
                          }

                       case 's':
                          {
                             FirstComma=job1.indexOf(',');
                             SecondComma=job1.lastIndexOf(',');
                             Scycle.cycleNumber=0;
                             Scycle.cycleNumber=Integer.parseInt(job1.substring(SecondComma+1));
                             stackjob.push(0);
                             stackcycle.push(Scycle.cycleNumber); 
                             break;
                          }

                       case 'h': 
                          {
                             continue;
                          }

                    }
                    job1=(String) inFile.next();

                 }   
                 System.out.println();
                 System.out.println();

                 while((stackjob.isEmptyStack()==false) && (stackcycle.isEmptyStack()==false)) 
                 {
                    int printjob;
                    int printcycle;
                    Object peek;

                    printjob=stackjob.peek();
                    printcycle=stackcycle.peek();
                    System.out.println("Job Number: "+printjob+" "+"Cycles Remaining: "+printcycle);
                    stackcycle.pop();
                    stackjob.pop(); 

                 } 

                 continue;
              }           
        }
        job1=inFile.next();   
     }   

     cycle whilecurrent= new cycle();

     while(list.isEmptyQueue()==false) 
     {
        whilecurrent=list.front();
        int whilecurrentcycle= cyclelist.front();
        list.print();
        //System.out.println();

        while(whilecurrentcycle != 0)
        {
           whilecurrentcycle--;
           //System.out.println("loop "+whilecurrentcycle);  
        }
        //System.out.println();
        //System.out.println(whilecurrent);

        cyclelist.deleteQueue();
        list.deleteQueue();   
     }  
     System.out.println();
     list.print();
     System.out.println(); 
  }

}

4

2 回答 2

5

您正在打印cycle对象的某个地方,并且由于您没有覆盖cycle.toString(),它使用的是默认toString实现

要覆盖toString类的方法,您需要编写如下代码:

class Xxx {
    @Override
    public String toString() {
         StringBuilder sb = new StringBuilder();
         sb.append("Your");
         sb.append("Logic Here");
         return sb.toString();
    }
}
于 2012-10-26T03:36:29.210 回答
-1

那是因为您没有覆盖toString()您尝试打印的类的默认方法。

于 2012-10-26T03:36:44.420 回答