🤔 PS(Problem Solving)/Leet, 구름

[매일프로그래밍] 코딩테스트 07/08/2019

문제 정수 배열(int array)가 주어지면 가장 큰 이어지는 원소들의 합을 구하시오. 단, 시간복잡도는 O(n).Given an integer array, find the largest consecutive sum of elements. 예제}Input: [-1, 3, -1, 5]Output: 7 // 3 + (-1) + 5 Input: [-5, -3, -1]Output: -1 // -1 Input: [2, 4, -2, -3, 8]Output: 9 // 2 + 4 + (-2) + (-3) + 8 내가 생각해본 풀이과정 1.규칙시간 복잡도는 O(n)입니다.더해지는 원소는 반드시 인덱스가 이어져 있어야 합니다. (arr[i] + arr[i+3] 같은 경우는 X) 2.순서 시간복잡도가 O(n)이니 2중 f..

[LeetCode] 1108번 - Defanging an IP Address(IP주소 못쓰게 만들기)

문제 1108. Defanging an IP AddressEasy1687FavoriteShareGiven a valid (IPv4) IP address, return a defanged version of that IP address.A defanged IP address replaces every period "." with "[.]". Example 1:Input: address = "1.1.1.1" Output: "1[.]1[.]1[.]1" Example 2:Input: address = "255.100.50.0" Output: "255[.]100[.]50[.]0" Constraints:The given address is a valid IPv4 address. 풀이과정 1.규칙IPv4 주소인 원배..

[LeetCode] 4번 - Median of Two Sorted Arrays(두 정렬된 배열의 중앙값)

문제 4. Median of Two Sorted ArraysHard4544636FavoriteShareThere are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).You may assume nums1 and nums2 cannot be both empty.Example 1:nums1 = [1, 3] nums2 = [2] The median is 2.0 Example 2:nums1 = [1, 2] nums2 = [3, 4] The median is (2 + 3)/2 ..

[LeetCode] 832번 - Flipping an Image(상 뒤집기)

문제 832. Flipping an ImageEasy529110FavoriteShareGiven a binary matrix A, we want to flip the image horizontally, then invert it, and return the resulting image.To flip an image horizontally means that each row of the image is reversed. For example, flipping [1, 1, 0] horizontally results in [0, 1, 1].To invert an image means that each 0 is replaced by 1, and each 1 is replaced by 0. For example,..

[LeetCode] 905번 - Sort Array By Parity(홀짝성 여부로 배열 정렬)

문제 905. Sort Array By ParityEasy48854FavoriteShareGiven an array A of non-negative integers, return an array consisting of all the even elements of A, followed by all the odd elements of A.You may return any answer array that satisfies this condition. Example 1:Input: [3,1,2,4] Output: [2,4,3,1] The outputs [4,2,3,1], [2,4,1,3], and [4,2,1,3] would also be accepted. Note:1

[LeetCode] 217번 - Contains Duplicate(중복이 포함되어 있는가?)

문제 [LeetCode 링크]217. Contains DuplicateEasy416526FavoriteShareGiven an array of integers, find if the array contains any duplicates.Your function should return true if any value appears at least twice in the array, and it should return false if every element is distinct.Example 1:Input: [1,2,3,1] Output: trueExample 2:Input: [1,2,3,4] Output: falseExample 3:Input: [1,1,1,3,3,4,3,2,4,2] Output: t..