We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I am a beginner. So can anyone tell me if this is more efficient than the above code or not?
.......
.......
for (int i = 0; imaxA){
maxA=a[i];
}
public static int lcm(int[] ai){
int lcm1= maxA;
int lcmMin=lcm1;
while(true){
for (int i =0; i<ai.length;i++){
if(lcm1%ai[i]==0){
countA++;
}
}
if (countA==ai.length){
lcmMin=lcm1;
break;
}
else{
lcm1++;
}
}
return lcmMin;
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Between Two Sets
You are viewing a single comment's thread. Return to all comments →
I am a beginner. So can anyone tell me if this is more efficient than the above code or not?
....... ....... for (int i = 0; imaxA){ maxA=a[i]; }