루루의 우당탕탕 개발 스토리 루루의 우당탕탕 개발 스토리

https://leetcode.com/problems/middle-of-the-linked-list/?envType=study-plan&id=level-1 class Solution { public ListNode middleNode(ListNode head) { Map map = new HashMap(); int i = 0; for (; head != null; i++) { map.put(i, head); head = head.next; } int middle = Math.round(i/2); return map.get(middle); } }

https://leetcode.com/problems/merge-two-sorted-lists/?envType=study-plan&id=level-1 Merge Two Sorted Lists - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com class Solution { public ListNode mergeTwoLists(ListNode list1, ListNode list2) { ListNode sortedNode = new ListNode(); ListNo..

https://leetcode.com/problems/reverse-linked-list/?envType=study-plan&id=level-1 Reverse Linked List - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com class Solution { public ListNode reverseList(ListNode head) { ListNode reversedNode = null; while(head != null){ ListNode tmp = hea..

https://leetcode.com/problems/is-subsequence/ class Solution { public boolean isSubsequence(String s, String t) { String[] s_lt = s.split(""); String[] t_lt = t.split(""); if (s.length() == 0) return true; int index = 0; for(String each_t: t_lt){ if (index == s_lt.length) return true; if(s_lt[index].equals(each_t)){ index++; } } if (index == s_lt.length) return true; return false; } }

일주일 남은 현 시점 17문제가 남았다. 대략 주말을 제외하여 5일동안 푼다고 치면 하루 최소 4문제는 풀어야 하는 셈. 회사 일과 이래저래 핑계로 지난번이랑 다를 바 없는 결론을 맞이했다. 지난번엔 어쨋든 꾸역꾸역 기간안에 마무리하긴 했는데, 이번에는 가능할지 모르겠다. 어쨋든 다시.. 도전..

https://leetcode.com/problems/isomorphic-strings/?envType=study-plan&id=level-1 Isomorphic Strings - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com class Solution { public boolean isIsomorphic(String s, String t) { HashMap map = new HashMap(); int i = 0; while (i < s.length()){ if..

https://leetcode.com/problems/find-pivot-index/?envType=study-plan&id=level-1 Find Pivot Index - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com class Solution { public int pivotIndex(int[] nums) { int pivot = 0; int total_sum = Arrays.stream(nums).sum(); for(int i = 0; i < nums.le..

https://leetcode.com/problems/running-sum-of-1d-array/?envType=study-plan&id=level-1 Running Sum of 1d Array - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com class Solution { public int[] runningSum(int[] nums) { Integer[] ans = new Integer[nums.length]; ans[0] = nums[0]; for (int..