1、Stack.size() ;实际有的元素个数
2、Stack.capacity();这个栈目前能存储的最多元素的个数
自己发现:
Stack 只要创建了对象后,Stack.capacity()=10,但此时Stack.size()=0;当向Stack中添加的元素超过10时,比如说添加11个元素时,Stack.capacity()=20,但此时Stack.size()=11;
这说明,Stack的容量是在动态的增加的,初始时的容量是10;
Stack.indexOf(" ");如果元素不在Stack中,则返回-1;
代码如下:
package Demo;
import java.util.ArrayList;
import java.util.Stack;
public class DemoStringEquals {
public static void main(String[] args) {
test1();
}
public static void test1(){
Stack stack = new Stack ();
System.out.println("stack="+stack);
System.out.println("stack.size()=="+stack.size());
System.out.println("stack.capacity()=="+stack.capacity());
System.out.println("=================================");
stack.add("a");
stack.add("b");
stack.add("c");
stack.add("c");
stack.add("c");
stack.add("c");
stack.add("c");
stack.add("c");
stack.add("c");
stack.add("c");
stack.add("c");
System.out.println("stack="+stack);
System.out.println("stack.size()=="+stack.size());
System.out.println("stack.capacity()=="+stack.capacity());
System.out.println(stack.get(0));
System.out.println("stack.indexOf(a)=="+stack.indexOf("a"));
System.out.println("stack.indexOf(c1)=="+stack.indexOf("c"));
System.out.println("stack.indexOf(c2)=="+stack.indexOf("c"));
System.out.println("stack.indexOf(null)=="+stack.indexOf("aa"));
}}
运行的结果为: