You are viewing a single comment's thread. Return to all comments →
#working first two cases passed, timeout
public static List waiter(List number, int q) { // Write your code here
List<Integer> answer=new ArrayList<>(); ArrayList<Integer> primelist=new ArrayList<>(); // to gernerate prime number if(q==1){ primelist.add(2); }else if(q>1){ primelist.add(2); primelist.add(3); int m; for(int i=4;i<10000;i++){ if(primelist.size()==q){ break; } m=i/2; // to check i is prime or not for(int j=2;j<=m;j++){ if(i%j!=0){ primelist.add(i); } } } } Stack<Integer> A=new Stack<>(); Stack<Integer>A1=new Stack<>(); Stack<Integer>B1=new Stack<>(); for(int i=0;i<number.size();i++){ A.push(number.get(i)); } //iteration for(int i=0;i<primelist.size();i++){ while(A.size()!=0){ if(A.peek()%primelist.get(i)==0){ B1.push(A.pop()); } else{ A1.push(A.pop()); } } while(B1.size()!=0){ answer.add(B1.pop()); } if(i+1==primelist.size()){ while(A1.size()!=0){ answer.add(A1.pop());} break; } while(A1.size()!=0){ A=A1; A1=new Stack<>(); } }
return answer; }
Waiter
You are viewing a single comment's thread. Return to all comments →
#working first two cases passed, timeout
public static List waiter(List number, int q) { // Write your code here
return answer; }