java 栈 int_Java 为int值创建堆栈

public class StackOfInts {

/*来自

n o w j a v a . c o m*/

private int[] stack;

private int next = 0; // index of last item in stack + 1

public StackOfInts(int size) {

//create an array large enough to hold the stack

stack = new int[size];

}

public void push(int on) {

if (next < stack.length)

stack[next++] = on;

}

public boolean isEmpty() {

return (next == 0);

}

public int pop() {

if (!isEmpty())

return stack[--next]; // top item on stack/* from 时 代 J a v a - nowjava.com*/

else

return 0;

}

public int getStackSize() {

return next;

}

private class StepThrough {

// start stepping through at i=0

private int i = 0;

// increment index

public void increment() {

if (i < stack.length)

i++;

}

// retrieve current element

public int current() {

return stack[i];

}

// last element on stack?

public boolean isLast() {

if (i == getStackSize() - 1)

return true;

else

return false;

}

}

public StepThrough stepThrough() {

return new StepThrough();

}

public static void main(String[] args) {

// instantiate outer class as "stackOne"

StackOfInts stackOne = new StackOfInts(15);

// populate stackOne

for (int j = 0; j < 15; j++) {

stackOne.push(2 * j);

}

// instantiate inner class as "iterator"

StepThrough iterator = stackOne.stepThrough();

// print out stackOne[i], one per line

while (!iterator.isLast()) {

System.out.print(iterator.current() + " ");

iterator.increment();

}

System.out.println();

}

}

/*

* Copyright (c) 1995, 2008, Oracle and/or its affiliates. All rights reserved.

*

* Redistribution and use in source and binary forms, with or without

* modification, are permitted provided that the following conditions

* are met:

*

* - Redistributions of source code must retain the above copyright

* notice, this list of conditions and the following disclaimer.

*

* - Redistributions in binary form must reproduce the above copyright

* notice, this list of conditions and the following disclaimer in the

* documentation and/or other materials provided with the distribution.

*

* - Neither the name of Oracle or the names of its

* contributors may be used to endorse or promote products derived

* from this software without specific prior written permission.

*

* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS

* IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,

* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR

/**代码未完, 请加载全部代码(NowJava.com).**/

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值