나만의 repository

Roman to Integer - 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 romanToInt(String s) { if (s == null || s.length() == 0) { return 0; } final Map romanMap = getRomanMap(); if (s.length() == 1) { return romanMap.get(s); } final String[] letters = ..

Container With Most Water - 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 나의 풀이 public class Solution_ContainerWithMostWater { public int maxArea(int[] height) { int left = 0; int right = height.length - 1; int answer = calculateArea(height, left, right); while (left < right) { i..

Reverse Integer - 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 reverse(int x) { long absVal = x; if (absVal < 0) { absVal *= -1; } StringBuilder sb = new StringBuilder(String.valueOf(absVal)); String reverse = sb.reverse().toString(); long ans =..

Longest Palindromic Substring - 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 String longestPalindrome(String s) { String ans = String.valueOf(s.charAt(0)); String temp = ""; for (int i = 0; i < s.length() - 1; i++) { if (s.charAt(i) == s.charAt(i + ..

Median of Two Sorted Arrays - 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 나의 풀이 - 실패 떠올린 방식 1. 하나의 배열에 모두 넣고 binary search - time complexity : O(n log n) - 문제의 시간 복잡도 제한 조건을 만족하지 못하는 풀이 2. lowerBound를 이용해서 해당 수보다 작거나 같은 수를 찾아서 각각 확인하는 방식 - time complexity : O(log (n + m)) - 배열의..

Longest Substring Without Repeating Characters - 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 lengthOfLongestSubstring(String s) { int len = s.length(); Map map = new HashMap(); int maxLen = 0; int curLen = 0; for (int i = 0; i < len; i++) { if ..

나의 풀이 class Solution { public static ListNode addTwoNumbers(ListNode l1, ListNode l2) { ListNode headNode = new ListNode((l1.val + l2.val) % 10); ListNode curNode = headNode; int carry = (l1.val + l2.val) / 10; l1 = l1.next; l2 = l2.next; while (Objects.nonNull(l1) || Objects.nonNull(l2)) { int firstVal = Objects.nonNull(l1) ? l1.val : 0; int secondVal = Objects.nonNull(l2) ? l2.val : 0; int tot..

Two Sum - 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 나의 풀이 import java.util.*; class Solution { public static int[] twoSum(int[] nums, int target) { Map numPositions = new HashMap(); for (int i = 0; i < nums.length; i++) { if (numPositions.containsKey(target - nums[i])) { retu..