转自:http://hi.baidu.com/aekdycoin/item/248e312579f53f54c38d59a3
排序
compareTo中,返回-1类似C++中重载的'<'import java.io.*;
import java.util.*;
import java.math.*;
import java.text.*;
class Node implements Comparable
{
public int val;
public Node(int v){this.val=v;}
public int compareTo(Object obj)
{
if(obj instanceof Node){
Node oo=(Node)obj;
if(this.val<oo.val)
return -1;
if(this.val>oo.val)
return 1;
}
return 0;
}
}
public class Main {
public static void main(String args[]) throws Exception
{
int i;
Scanner cin=new Scanner(System.in);
Node a[]=new Node[4];
for(i=0;i<4;i++)a[i]=new Node(i+1);
Arrays.sort(a);
for(i=0;i<4;i++)
System.out.print(a[i].val+((i==3)?"\n":" "));
}
}
Arrays.sort(long A[],int L,int R);
longA[]表示等待排的数组
在[L,R)内排
//刚写的一个最简单的栈...
import java.io.*;
import java.util.*;
import java.math.*;
import java.text.*;
class stack
{
private int a[]=new int[1001],top;
public stack(){top=0;}
public void push(int val){a[top++]=val;}
public boolean empty(){return top==0;}
public int pop(){if(top==0){System.out.println("警告:栈为空!");return -1;}return this.a[--top];}
}
public class Main {
public static void main(String args[]) throws Exception
{
stack S=new stack();
S.push(5);
S.push(7);
S.push(98);
S.push(123);
while(!S.empty())
{
System.out.print(S.pop()+" ");
}
}
}