longestpiece.java

这是一个对于输入的任意长度的二进制数输出其最长0连续序列个数和最长1连续序列个数的算法程序

public class LongestPiece{
	public static void main(String[] args){
		if(args.length == 0){
			System.out.println("put the right number again!");
			return;
		}
		Long num = Long.parseLong(args[0]);
		System.out.println("数据1/0串:");
		long template = 1;
		template = template<<63;
		long result;
		int zero = 0,one = 0,x = 0,y = 0;
		for(int i = 0;i < 64; i++){
			result = num&template;
			if(result == 0){
				System.out.print(0);
				one = 0;
				zero++;
				if(zero > x)
					x = zero;
			}
			else{
				System.out.print(1);
				zero = 0;
				one++;
				if(one > y)
					y = one;
			}
			num = num<<1;
		}
		System.out.println();
		System.out.println("最长0串长度:"+x);
		System.out.println("最长1串长度:"+y);
	}
}