silvergoni.builder()

https://leetcode.com/problems/linked-list-cycle/ 3. 2022/04/29 시도 소요시간: 12분 public class Solution { public boolean hasCycle(ListNode head) { if (head == null || head.next == null) { return false; } ListNode slow = head; ListNode fast = head; while (fast != null && fast.next !=null) { slow = slow.next; fast = fast.next.next; if (fast == slow) { return true; } } return false; } } 풀이 접근 과정 edge케이스 ..

https://leetcode.com/problems/squares-of-a-sorted-array/ 3. 2022/04/28 시도 소요시간: 4분 class Solution { public int[] sortedSquares(int[] nums) { int left = 0; int right = nums.length - 1; int index = nums.length - 1; int[] ret = new int[nums.length]; while (left

https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array/ 1. 2022/04/27 시도 소요시간: 30분 class Solution { public List findDisappearedNumbers(int[] nums) { Arrays.sort(nums); // remove duplicates int end = 1; int prev = nums[0]; for (int i=1; i=0; i--) { nums[nums[i]-1] = nums[i]; } // get missing number List ret = new ArrayList(); for (int i=0; i

https://leetcode.com/problems/third-maximum-number/ 1. 2022/04/26 시도 소요시간: 10분(array이용), 5분(priorityQueue이용) // array class Solution { public int thirdMax(int[] nums) { Arrays.sort(nums); // remove duplicated int prev = nums[0]; int index = 1; for (int i=1; i

https://leetcode.com/problems/max-consecutive-ones-ii/ 1. 2022/04/26 시도 소요시간: 10분 class Solution { public int findMaxConsecutiveOnes(int[] nums) { int prev = 0; int counter = 0; int max = 0; for (int i=0; i

https://leetcode.com/problems/height-checker/ 1. 2022/04/26 시도 소요시간: 4분 class Solution { public int heightChecker(int[] heights) { int[] copied = new int[heights.length]; for (int i=0; i

https://leetcode.com/problems/remove-element/ 2. 2022/04/26 시도 소요시간: 3분 class Solution { public int removeElement(int[] nums, int val) { int index = 0; for (int i=0; i

https://leetcode.com/problems/sort-array-by-parity/ 1. 2022/04/25 시도 소요시간: 5분 class Solution { public int[] sortArrayByParity(int[] nums) { int lastEvenIndex = -1; for (int i=0; i

https://leetcode.com/problems/move-zeroes/ 2. 2022/04/25 시도 소요시간: 8분 class Solution { public void moveZeroes(int[] nums) { int pos = 0; int zeros = 0; for (int i=0; i

https://leetcode.com/problems/remove-duplicates-from-sorted-array/ 2. 2022/04/25 시도 소요시간: 4분 class Solution { public int removeDuplicates(int[] nums) { int counter = 1; for (int i=1; i