Problem 8

问题描述：
Find the greatest product of five consecutive digits in the 1000-digit number.

73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
12540698747158523863050715693290963295227443043557
66896648950445244523161731856403098711121722383113
62229893423380308135336276614282806444486645238749
30358907296290491560440772390713810515859307960866
70172427121883998797908792274921901699720888093776
65727333001053367881220235421809751254540594752243
52584907711670556013604839586446706324415722155397
53697817977846174064955149290862569321978468622482
83972241375657056057490261407972968652414535100474
82166370484403199890008895243450658541227588666881
16427171479924442928230863465674813919123162824586
17866458359124566529476545682848912883142607690042
24219022671055626321111109370544217506941658960408
07198403850962455444362981230987879927244284909188
84580156166097919133875499200524063689912560717606
05886116467109405077541002256983155200055935729725
71636269561882670428252483600823257530420752963450

找到连续的五个数相乘的最大数。
执行的结果：
40824 count_for1:4975
40824 count_for2:2495

为了提高效率，遇到0，可以向后滑动！

	public static int count_for1 = 0;
	public static int count_for2 = 0;
	public static String read(){
		StringBuffer s = new StringBuffer();
		try {
			BufferedReader br = new BufferedReader(new FileReader("f:/1.txt"));
			String line ;
			while((line=br.readLine())!=null){
				s.append(line);
			}
		} catch (FileNotFoundException e) {

		} catch (Exception e){

		}
		return s.toString();
	}

	public static int find_five_consecutive1(){
		int result = 1;
		int max = 0;
		String str = read();
		int begin = 0;
		int end = str.length();
		int step = 5;
		for(int i=begin; i<end-step; i++){
			result = 1;
			for(int j=0 ;j<step ;j++){
				result = result*Integer.parseInt(str.charAt(i+j)+"");
				count_for1++;
			}
			if(result>max){
				max = result;
			}
		}
		return max;
	}

	public static int find_five_consecutive2(){
		int result = 1;
		int max = 0;
		String str = read();
		int begin = 0;
		int end = str.length();
		int step = 5;
		for(int i=begin; i<end-step; i++){
			result = 1;
			for(int j=0 ;j<step ;j++){
				if(str.charAt(i+j)=='0'){
					i = i + step + step - j;
					break;
				}else{
					int number = Integer.parseInt(str.charAt(i+j)+"");
					result = result*number;
					count_for2++;
				}
			}
			if(result>max){
				max = result;
			}
		}
		return max;
	}