Stack——Java中封装好的栈
code:
import java.util.*;
public class pro_917<T> {
public static void main(String[] args)
{
Stack stack = new Stack();
stack.push("hello");
stack.push(2);
stack.push(true);
stack.push(new Date());
Iterator it = stack.iterator();
while(it.hasNext())
{
System.out.println(it.next());
}
while(!stack.isEmpty())
{
System.out.println(stack.pop());
}
}
}
实战code:
import java.util.*;
public class pro_917<T> {
public static void Convert(int num)
{
int i = 1;
Stack<Integer> stack = new Stack<Integer>();
while(num!=0)
{
stack.push(num%2);
num /= 2;
}
Iterator it = stack.iterator();
while(!stack.isEmpty())
{
System.out.print(stack.pop());
}
/* for(i=1;it.hasNext();i*=10)
{
num += (Integer)it.next()*i;
}*/
// return num;
}
public static void main(String[] args)
{
int num,bin;
Scanner in = new Scanner(System.in);
num = in .nextInt();
Convert(num);
//System.out.println(bin);
}
}
Queue——Java中封装好的队列
常用API: add() , remove()
Arrays ,可以对任意集合进行自然排序,通过调用sort()
调用Array.sort(obj); //实现对obj里面数字的自然排序
如果obj是一个class的集合则需要对comparableTo接口重新实现(因为在Java默认中智能对基本的obj类型如Interger,Float等进行大小判断排序,class中到底需要以哪一个key word的值来进行升序还要程序员自己完成)