대충이라도 하자

3. Sqrt -> Binary Search approach -> Since the floor of the square root of a number x lies between 0 and x/2 for all x > 1, we can use binary search within this range to find the square root -> binary Search : O(logN) -> O(1) for space complexity class Solution { public int mySqrt(int x) { if(x

2023.08.27 1. Contains Duplicate import java.util.HashSet; import java.util.Set; //0.242ms public class Solution { public boolean containsDuplicate(int[] nums) { // TODO: Write your code here Set set = new HashSet(); for(int i = 0; i Binary Search approach -> Since the floor of the square root of a number x lies between 0 and x/2 for all x > 1, we can use binary search within this range to find ..

Hard!!! - too many variables - think about the edge cases - array index starts from 0, but length of array is the same with just the number. class Solution { public double findMedianSortedArrays(int[] nums1, int[] nums2) { //median 찾기 //sorted arrays int s1= 0, s2=0, index=-1; int m = nums1.length; int n = nums2.length; int [] result = new int[m+n]; while(index != (m+n)/2){ index++; if(s1>m-1) {..

https://leetcode.com/list/xi4ci4ig/ Favorite - 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. Brute Force - O(N^2) class Solution { public int[] twoSum(int[] nums, int target) { int [] result = new int[2]; //1. for문 2개 for(int i =0; i

4개의 edge에서 어떻게 대처할 것인가 On top bolder in up trend: go right On right bolder in up trend: go down On left bolder in down trend: go down On bottom bolder in down trend: go right *** 1번과 2번이 동시에 발생하면 2번을 따르고 3번과 4번이 동시에 발생하면 4번을 따라야 한다. 1. DFS 방법으로 하려고 했음 -> 왜인지 모르겠으나 아래와 같은 오류 발생 => FAILED WARNING: A command line option has enabled the Security Manager WARNING: The Security Manager is deprecated an..

At first, I used 2 for loops, but in aspects of time space, it was not efficient. I thought about several ways, then, chose to use dynamic programming.( Need to study more about dp) This is what I solved the problem. class Solution { public int maxProfit(int[] prices) { int min = Integer.MAX_VALUE; int max = 0; for(int i = 0; i

Array & Dynamic Array What is the difference between array and dynamic array? What is the corresponding built-in data structure of array and dynamic array in your frequently-used language? How to perform basic operations (initialization, data access, modification, iteration, sort, etc) in an array? How to perform basic operations (initialization, data access, modification, iteration, sort, addit..

Number of Provinces -> Here is how I solved this problem. class Solution { public int findCircleNum(int[][] isConnected) { int count = 0; boolean [] visited = new boolean[isConnected.length]; for(int i = 0; i