Guest User

Untitled

a guest
Apr 30th, 2022
83
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.81 KB | None | 0 0
  1. class Solution {
  2. public int[] solution(int N, int[] A) {
  3. int[] result = new int[N];
  4. for(int i = 0; i < N; i++) {
  5. result[i] = 0;
  6. }
  7. for(int i = 0; i < A.length; i++) {
  8. if(A[i] >= 1 && A[i] <= N) {
  9. result = increase(A[i], result);
  10. } else if (A[i] == N + 1) {
  11. maxCounter(result);
  12. }
  13. }
  14. return result;
  15. }
  16. public int[] increase(int i, int[] j) {
  17. j[i-1] += 1;
  18. return j;
  19. }
  20.  
  21. public int[] maxCounter(int[] j) {
  22. int maxElement = 0;
  23. for(int i = 0; i < j.length; i++) {
  24. maxElement = Math.max(j[i], maxElement);
  25. }
  26. for(int z = 0; z < j.length; z++) {
  27. j[z] = maxElement;
  28. }
  29. return j;
  30. }
  31. }
Advertisement
Add Comment
Please, Sign In to add comment