Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- class Solution {
- public int[] solution(int N, int[] A) {
- int[] result = new int[N];
- for(int i = 0; i < N; i++) {
- result[i] = 0;
- }
- for(int i = 0; i < A.length; i++) {
- if(A[i] >= 1 && A[i] <= N) {
- result = increase(A[i], result);
- } else if (A[i] == N + 1) {
- maxCounter(result);
- }
- }
- return result;
- }
- public int[] increase(int i, int[] j) {
- j[i-1] += 1;
- return j;
- }
- public int[] maxCounter(int[] j) {
- int maxElement = 0;
- for(int i = 0; i < j.length; i++) {
- maxElement = Math.max(j[i], maxElement);
- }
- for(int z = 0; z < j.length; z++) {
- j[z] = maxElement;
- }
- return j;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment