Java443 [LeetCode/Java] Find All Numbers Disappeared in an Array class Solution { public List findDisappearedNumbers(int[] nums) { int numsLength = nums.length; boolean[] numsCheck = new boolean[numsLength + 1]; List answer = new ArrayList(); for (int num : nums) { numsCheck[num] = true; } for (int i = 1; i 2025. 11. 24. [LeetCode/Java] How Many Numbers Are Smaller Than the Current Number -Codeclass Solution { public int[] smallerNumbersThanCurrent(int[] nums) { int numLen = nums.length; int[] answer = new int[numLen]; for (int i = 0; i nums[j]) answer[i]++; } } return answer; }} 2025. 11. 24. [LeetCode/Java] Set Mismatch -Codeclass Solution { public int[] findErrorNums(int[] nums) { int[] numCnt = new int[nums.length + 1]; int[] answer = new int[2]; for (int num : nums) { numCnt[num]++; } for (int i = 1; i 2025. 11. 24. [LeetCode/Java] Max Consecutive Ones -Codeclass Solution { public int findMaxConsecutiveOnes(int[] nums) { int answer = 0; int cnt = 0; for (int num : nums) { if (num == 1) { cnt++; } else { answer = Math.max(answer, cnt); cnt = 0; } } return Math.max(answer, cnt); }} 2025. 11. 24. [LeetCode/Java] Shuffle the Array -Codeclass Solution { public int[] shuffle(int[] nums, int n) { int[] answer = new int[n * 2]; int idx = 0; for (int i = 0; i 2025. 11. 24. [LeetCode/Java] Concatenation of Array -Codeclass Solution { public int[] getConcatenation(int[] nums) { int len = nums.length * 2; int[] answer = new int[len]; for (int i = 0; i 2025. 11. 24. 이전 1 ··· 52 53 54 55 56 57 58 ··· 74 다음