指令 无效 调试 @stack 队列

huangapple
go评论94阅读模式
英文:

commands invalid debugged @stack queue

问题

我在处理我的堆栈程序时遇到了问题，我真的不理解我的错误。我能得到一些帮助吗？每次我尝试运行它时，都会出现多个错误，我对其中的一些事情感到非常困惑。我有总共 60 个错误。因此整个程序都有问题。我所尝试做的就是在这个堆栈和队列程序中创建一些名字。

  1. public class YourStackNB {
  2.     private int maxSize;
  3.     private long[] stackArray;
  4.     private int top;
  5.    
  6.     public YourStackNB(int s) {
  7.         maxSize = s;
  8.         stackArray = new long[maxSize];
  9.         top = -1;
  10.     }
  11.     public void push(long j) {
  12.         stackArray[++top] = j;
  13.     }
  14.     public long pop() {
  15.         return stackArray[top--];
  16.     }
  17.     public boolean isEmpty() {
  18.         return (top == -1);
  19.     }
  20.     public static void main(String[] args) {
  21.         YourStackNB theStack = new YourStackNB();
  22.         Stack<Name> even = new Stack<>();
  23.         theStack.push(dino);
  24.         theStack.push(perry);
  25.         theStack.push(jada);
  26.         theStack.push(holly);
  27.         theStack.push(nori);
  28.       
  29.         while (!theStack.isEmpty()) {
  30.             long value = theStack.pop();
  31.             System.out.print(value);
  32.             System.out.print(" ");
  33.         }
  34.         System.out.println("");
  35.     }
  36. }
英文:

Im having trouble with my stack program and I don't really understand my errors. Can I please get some help? Every time i try to run it, it has multiple errors and im extremely confused on a few things. the errors i have is a total of 60 errors.
therefore the whole program is off. All im trying to do is to create names in this stack and queue program.

  1. public class YourStackNB {
  2. private int maxSize;
  3. private long[] stackArray;
  4. private int top;
  6. public YourStackNB(int s) {
  7.   maxSize = s;
  8.   stackArray = new long[maxSize];
  9.   top = -1;
  10. }
  11. public void push(long j) {
  12.   stackArray[++top] = j;}
  13. public long pop() {
  14.  return stackArray[top--];
  15.   }
  16.  public boolean isEmpty() {
  17.   return (top == -1);
  18. }
  19.    public static void main(String[] args) {
  20.   YourStackNB theStack = new YourStackNB();
  21.   Stack&lt;Name&gt; even = new Stack&lt;&gt;();
  22.   theStack.push(dino);
  23.   theStack.push(perry);
  24.   theStack.push(jada);
  25.   theStack.push(holly);
  26.   theStack.push(nori);
  27.   
  28.   while (!theStack.isEmpty()) {
  29.      long value = theStack.pop();
  30.      System.out.print(value);
  31.      System.out.print(&quot; &quot;);
  32.   }
  33.   System.out.println(&quot;&quot;);
  34. }
  36.  }

答案1

得分: 0

你正在尝试使用数组实现栈。但是你没有正确使用它。相反，你试图使用java.util.Stack，并传递了错误的类型Name。

另一件事是，你试图实现long数据类型的栈。但是你却在尝试放一些字符串进去。这些代码是不正确的。

  1. //  Stack&lt;Name&gt; even = new Stack&lt;&gt;();
  2. //  theStack.push(dino);
  3. //  theStack.push(perry);
  4. //  theStack.push(jada);
  5. //  theStack.push(holly);
  6. //  theStack.push(nori);

我建议你尝试编写一些基本的Java程序，以便更熟悉Java语法，这将有助于你更好地思考。

仅供你学习，我已经修复了错误，这段代码可以以更好的方式实现：

  1. public class YourStackNB {
  2.   private int maxSize;
  3.   private long[] stackArray;
  4.   private int top;
  5.     
  6.   public YourStackNB(int s) {
  7.     maxSize = s;
  8.     stackArray = new long[maxSize];
  9.     top = -1;
  10.   }
  11.   
  12.   public void push(long j) {
  13.     stackArray[++top] = j;
  14.   }
  15.   
  16.   public long pop() {
  17.     return stackArray[top--];
  18.   }
  19.   
  20.   public boolean isEmpty() {
  21.     return (top == -1);
  22.   }
  23.   
  24.   public static void main(String[] args) {
  25.     YourStackNB theStack = new YourStackNB(10);
  26.     
  27.     theStack.push(100);
  28.     theStack.push(200);
  29.     theStack.push(300);
  30.     theStack.push(400);
  31.     theStack.push(500);
  32.     
  33.     while (!theStack.isEmpty()) {
  34.       long value = theStack.pop();
  35.       System.out.print(value);
  36.       System.out.print(" ");
  37.     }
  38.     System.out.println();
  39.   }
  40. }

输出：

  1. 500 400 300 200 100

由于栈是后进先出（LIFO），因此它以我们插入元素的相反顺序打印输出。

英文:

You are trying to implement stack using array. But you are not using it properly. Rather you are trying to use java.util.Stack with passing incorrect type Name.

Another thing you are trying to implement Stack of long data type. But you are trying to put some string there. These codes are incorrect

  1. //  Stack&lt;Name&gt; even = new Stack&lt;&gt;();
  2. //  theStack.push(dino);
  3. //  theStack.push(perry);
  4. //  theStack.push(jada);
  5. //  theStack.push(holly);
  6. //  theStack.push(nori);

I can suggest you please try to write some basic java program so that you are more aware of java syntax and it will help you to better thinking.

Just for your learning I am fixing the errors and this code can be implemented in better way

  1. public class YourStackNB {
  2. private int maxSize;
  3. private long[] stackArray;
  4. private int top;
  6. public YourStackNB(int s) {
  7.   maxSize = s;
  8.   stackArray = new long[maxSize];
  9.   top = -1;
  10. }
  11. public void push(long j) {
  12.   stackArray[++top] = j;}
  13. public long pop() {
  14.  return stackArray[top--];
  15.   }
  16.  public boolean isEmpty() {
  17.   return (top == -1);
  18. }
  19.    public static void main(String[] args) {
  20.   YourStackNB theStack = new YourStackNB(10);
  22.   theStack.push(100);
  23.   theStack.push(200);
  24.   theStack.push(300);
  25.   theStack.push(400);
  26.   theStack.push(500);
  27. //  Stack&lt;Name&gt; even = new Stack&lt;&gt;();
  28. //  theStack.push(dino);
  29. //  theStack.push(perry);
  30. //  theStack.push(jada);
  31. //  theStack.push(holly);
  32. //  theStack.push(nori);
  33.   
  34.   while (!theStack.isEmpty()) {
  35.      long value = theStack.pop();
  36.      System.out.print(value);
  37.      System.out.print(&quot; &quot;);
  38.   }
  39.   System.out.println(&quot;&quot;);
  40. }
  42.  }

> OUTPUT:
> 500 400 300 200 100

As stack is last in first out(LIFO) thus it's printing in reverse order we inserted the element into it.

huangapple
  • 本文由 发表于 2020年9月18日 12:00:11
  • 转载请务必保留本文链接：https://go.coder-hub.com/63949131.html
  • java
  • jgrasp
  • queue
  • stack
匿名

发表评论

匿名网友

:?: :razz: :sad: :evil: :!: :smile: :oops: :grin: :eek: :shock: :???: :cool: :lol: :mad: :twisted: :roll: :wink: :idea: :arrow: :neutral: :cry: :mrgreen:

确定