笔试题复盘

公司名不便透漏

 

package org.algorithm;
/**
 * 找顺子
 * @author dg
 * @since 2012-7-4
 *
 */
public class Poker {
	public static int[] pokers = {12,13,14,1,2,3,4,6};
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Qsort1 qsort = new Qsort1();
		//1,sort
		qsort.qsort1(pokers, 0, pokers.length-1);
		//2,loop   find 3
		/**
		 * index: corresponds to pokers index
		 * value: counts of continues
		 */
		int[] IdxContinues = new int[pokers.length];
		int curStart = 0;//start of 3
		for(int i=1;i<pokers.length;i++){
			if(pokers[i]-pokers[i-1]==1){
				if(IdxContinues[curStart]==0){
					IdxContinues[curStart] = 1;
				}
				IdxContinues[curStart]++;
			}else{
				curStart=i;
			}
		}
		//3,find max(>=3)
		int max =0;
		int idx_max=-1;
		for(int i=0;i<IdxContinues.length;i++){
			if(IdxContinues[i]>=3&&IdxContinues[i]>=max){
				idx_max = i;
			}
		}
		if(idx_max>=0){
			System.out.println("=======================");
			for(int i = idx_max;i<idx_max+IdxContinues[idx_max];i++){
				System.out.println(pokers[i]);
			}
		}
	}
	
}