import java.util.List;
/** *//**
* 閾捐〃瀹炵幇ADT
* @author BruceLeey
*/
class Node {
Object obj; //鏁板煎煙
Node next; //閾懼煙
public Node() {
}
public Node(Object value) {
this.obj = value;
next = null;
}
}
class LinkList {
private Node first; //澶磋妭鐐癸紝涓嶈褰曞湪閾捐〃涔嬪唴
private int size; //璁板綍閾捐〃鑺傜偣闀垮害
public LinkList() {
first = null;
size = 0;
}
/** *//**
* 娣誨姞鑺傜偣
*
* @param value
*/
public void addNode(Object value) {
System.out.println("\n-------------------------娣誨姞鑺傜偣 " + value + " -------------------------");
Node currentNode = new Node(value);
currentNode.next = first; //褰撳墠鑺傜偣閾懼煙鎸囧悜澶磋妭鐐?/span>
first = currentNode; //澶磋妭鐐硅褰曞綋鍓嶈妭鐐瑰湴鍧
size++;
}
/** *//**
* 楠岃瘉鏄惁涓虹┖
* @return
*/
public boolean isEmpty() {
return size == 0;
}
/** *//**
* 鍒犻櫎琛ㄥご
* @param value
*/
public Node removeFirstNode() {
System.out.println("\n-------------------------縐婚櫎澶磋妭鐐?------------------------");
Node temp = first;
first = first.next; //鎸囧悜涓嬩竴鑺傜偣
size--;
System.out.println("\n縐婚櫎鐨勮〃澶存暟鎹負: " + temp.obj);
return temp; //榪斿洖鍒犻櫎鐨勮妭鐐?/span>
}
/** *//**
* 灝佽闀垮害
* @return
*/
public int getSize() {
return size;
}
/** *//**
* 鎵懼嚭绱㈠紩涔嬪墠鐨勮妭鐐?br /> * @param index
* @return
*/
public List<Node> getNodeByIndex(int index) {
System.out.println("\n-------------------------鏌ユ壘" + index + "涔嬪墠鐨勬墍鏈夎妭鐐?------------------------");
List<Node> list = new ArrayList<Node>();
assert (!(index > getSize() - 1 || index < 0));
Node current = first; //瀹氫綅鍒板ご鑺傜偣
for (int i = 0; i < index; i++) {
list.add(current);
current = current.next; //浠ユ寰涓嬬Щ
}
for (int j = 0; j < list.size(); j++) {
System.out.println("\n鏌ユ壘鍒扮殑鏁版嵁涓? " + list.get(j).obj);
}
return list;
}
/** *//**
* 杈撳嚭閾捐〃
*/
public void displayNode() {
System.out.println("\n-------------------------寮濮嬭緭鍑洪摼琛?------------------------");
assert (!this.isEmpty());
Node current = first;
for (int i = 0; i < getSize(); i++) {
System.out.println("鑺傜偣涓? " + current.obj.toString());
current = current.next;
}
}
}
public class TestAdt {
public static void main(String[] args) {
LinkList link = new LinkList();
for (int i = 0; i < 10; i++) {
link.addNode("鎴戞槸鑺傜偣 " + i);
}
link.displayNode();
Node node = link.removeFirstNode();
link.displayNode();
link.getNodeByIndex(5);
link.displayNode();
}
}
]]>
int [] people = new int[17];
int lastPeople = 0;
public void getTheLastPeople(){
for(int i = 0; i < people.length; i++){
people[i] = i+1;
}
int count = 0;
int countLast = 0;
int j = 0;
while(true){
for(j = 0; j < people.length; j++){
if(people[j] != 0){
count++;
people[j] = count;
System.out.println("people[" + j + "] = " + people[j]);
if (people[j] % 3 == 0) {
people[j] = 0;
countLast++;
if(countLast == 17){
lastPeople = j;
return;
}
}
}
}
}
}
int lastPeople = 0;
public void getTheLastPeople(){
for(int i = 0; i < people.length; i++){
people[i] = i+1;
}
int count = 0;
int countLast = 0;
int j = 0;
while(true){
for(j = 0; j < people.length; j++){
if(people[j] != 0){
count++;
people[j] = count;
System.out.println("people[" + j + "] = " + people[j]);
if (people[j] % 3 == 0) {
people[j] = 0;
countLast++;
if(countLast == 17){
lastPeople = j;
return;
}
}
}
}
}
}
]]>