-
Notifications
You must be signed in to change notification settings - Fork 0
/
LargestProduct.java
60 lines (51 loc) · 1.43 KB
/
LargestProduct.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
package com.rushqui.problem;
public class LargestProduct {
private Integer digits[];
private String arr[];
private Integer v=0;
private Integer n=0;
private Integer k=0;
private Integer multiply=1;
private String stringNumber;
private Integer product[];
private Integer bigger=0;
private Integer z=0;
public void largestProduct(Long number,Integer K) {
k=K;
stringNumber=String.valueOf(number);
arr=stringNumber.split("");
digits=new Integer[arr.length];
for(int i=0;i<=arr.length-1;i++) {
digits[i]=Integer.valueOf(arr[i]);
}
while(v<=arr.length && v+k<=arr.length) {
for(int j=0;j<=k-1;j++) {
//System.out.println(digits[n]);
multiply*=digits[n];
n++;
}
product=new Integer[arr.length];
product[v]=multiply;
if(product[v]>bigger) {
bigger=product[v];
z=v;
}
//System.out.println(product[v]);
multiply=1;
v++;
n=v;
}
System.out.println("Producto mayor de k digitos encontrado:"+" "+bigger);
if(bigger>0) {
System.out.println("Digitos consecutivos:");
for(int r=z;r<=(z+k)-1;r++) {
System.out.println(digits[r]);
}
}
}
public static void main(String[] args){
LargestProduct problem =new LargestProduct();
problem.largestProduct(3675356291L,5); //el primer parametro corresponde al numero que se desea analizar
//el segundo corresponde a k
}
}