2008年下半年试题七
java.util库中提供了Vector模板类,可作为动态数组使用,并可容纳任意数据类型。
import java.util.*;
public class JavaMain {
static private final int ARRAY_SIZE=6;
public static void main(String[] args) {
Vector theVector = new Vector < Integer >();//初始化theVector;
for(int cEachItem =0;cEachItem<ARRAY_SIZE;cEachItem++) {
theVector.add(cEachItem);
}
showVector(theVector);
theVector.removeElementAt(3);
showVector(theVector);
}
public static void showVector(Vector theVector) {
if(theVector.isEmpty()) {
System.out.println("theVector is Empty.");
return ;
}
for(int loop=0;loop<theVector.size();loop++) {
System.out.print(theVector.get(loop));
System.out.print(",");
}
System.out.println();
}
}
输出为:
0,1,2,3,4,5,
0,1,2,4,5,
2015年下半年试题六
import java.util.ArrayList;
import java.util.List;
class Stock{
private String name;
private int quantity;
public Stock(String name,int quantity) {
this.name=name;
this.quantity=quantity;
}
public void buy() {
System.out.println("【买进】:"+name+",数量:"+quantity);
}
public void sell() {
System.out.println("【卖出】:"+name+",数量:"+quantity);
}
}
interface Order{
void execute();
}
class BuyStock implements Order{
private Stock stock;
public BuyStock(Stock stock) {
this.stock=stock;
}
public void execute() {
stock.buy();
}
}
class SellStock implements Order{
private Stock stock;
public SellStock(Stock stock) {
this.stock=stock;
}
public void execute() {
stock.sell();
}
}
class Broker{
private List<Order> orderList = new ArrayList<Order>();
public void takeOrder(Order order) {
orderList.add(order);
}
public void placeOrders() {
for(Order order:orderList) {
order.execute();
}
orderList.clear();
}
}
public class Main {
public static void main(String args []) {
Stock aStock = new Stock("股票A",10);
Stock bStock = new Stock("股票B",20);
Order buyStockOrder = new BuyStock(aStock);
Order sellStockOrder = new SellStock(bStock);
Broker broker = new Broker();
broker.takeOrder(buyStockOrder);
broker.takeOrder(sellStockOrder);
broker.placeOrders();
}
}
运行结果:
【买进】:股票A,数量:10
【卖出】:股票B,数量:20
创建一个十进制向其他进制转换的类
class Node{
int data;
Node next;
}
class Transform{
private Node top;
public void print() {
Node p;
while(top!=null) {
p=top;
if(p.data>9) {
System.out.print((char)(p.data+55));
}
else {
System.out.print(p.data);
}
top=p.next;
}
}
public void Trans(int d,int i) {
int m;
boolean n=false;
Node p;
while(d>0) {
m=d%i;
d=d/i;
p=new Node();
if(!n) {
p.data=m;
top->next=null;
top=p;
n=true;
}
else {
p.data=m;
p->next=top;
top=p;
}
}
}
}