Advertisement
TheRealMyth

twoTimesSolution

May 17th, 2021
61
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.90 KB | None | 0 0
  1. public class twoTimes{
  2. public static boolean twoTimes(int[] arr){
  3. if (arr.length%2!=0){return false;}
  4. int counterA=1;
  5. int counterB=0;
  6. int positionA=0;
  7. int positionB=1;
  8. int currentNumber=arr[positionA];
  9. while(positionB<arr.length){
  10. if (arr[positionB]==arr[positionA]){
  11. counterA++;
  12. }
  13. positionB++;
  14. if(positionB==arr.length){
  15. if(counterA==2){
  16. counterB++;
  17. positionA++;
  18. positionB=positionA+1;
  19. counterA=1;
  20. }
  21. else {
  22. positionA++;
  23. positionB=positionA+1;
  24. counterA=1;
  25. }
  26. }
  27. }
  28. return (counterB==arr.length/2);
  29. }
  30. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement