java算法题——扑克牌玩法1

题目以及要求：

代码：

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class WSYUP扑克牌 {
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		List<Integer> list = new ArrayList<Integer>();
		int i;
		int first=0;
		int countJIA=0;
		int countYI=0;
		int p=1;
		for ( i = 0;; i++) {			
			list.add(sc.nextInt());
			if(list.get(i)==0){
				break;
			}
		}
		int m=0;
		first=list.get(m);
		if(i>10){
			i=10;
		}
		if(i>1){
		for (int j = 1; j <i; j++) {
			if(list.get(j)==first){
				list.remove(j);
				j-=1;
				i--;
				if (p%2==0) {				
					countJIA+=first;
				}else{
					countYI+=first;
				}	
				if (m!=list.size()-2) {
					m++;
					first=list.get(m);
				}
			}
			p++;
		}
		}
		if (countJIA>countYI) {
			System.out.println("JIA");
		}else if (countJIA<countYI) {
			System.out.println("YI");
		}else{
			System.out.println("PING");
		}
	}
}