기억은 날아가지만 기록은 남는다

class Solution { public int maxProduct(int[] nums) { int numsLength = nums.length; int max = nums[0]; int min = nums[0]; int result = nums[0]; for(int idx = 1; idx < numsLength; idx++){ max = Math.max(nums[idx], Math.max(max*nums[idx], min*nums[idx])); min = Math.min(nums[idx], Math.min(max*nums[idx], min*nums[idx])); result = Math.max(result, Math.max(max, min)); } return result; } }​ Maximum P..

Maximum Subarray - 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 Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. A subarray is a contiguous part of an array. Example 1: Input: nums = [-2,1,-3..

Product of Array Except Self - 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 문제 설명 Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. The product of any prefix or suffix of nums is guaranteed..

문제 설명 Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct. Example 1: Input: nums = [1,2,3,1] Output: true Example 2: Input: nums = [1,2,3,4] Output: false Example 3: Input: nums = [1,1,1,3,3,4,3,2,4,2] Output: true Constraints: 1

지난번에 Two-Sum을 BruteForce 방식으로 풀고 나서 시간을 단축하기 위해 HashMap을 쓰고 싶다 라는 생각을 했었다. [LeetCode] problem 1. Two Sum Description. Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one so.. itkevin.tistory.com 오늘 코드 리뷰 이전까지 바쁘다는 핑계로 시도를 못했지만 오늘 다른 스터디원들의 친절하고 자세한 코드 리뷰를 듣고 용기를 내어 다시 풀어봐야겠..

Description. Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order. 이 문제를 보고 가장 처음 든 생각 1. 반복문을 돌려야 되는데 중복을 피해야겠다 2. 정렬을 해야할까? 였다. 첫 번째 풀이 [통과] : "반복문을 돌려야 하는데 중복을 피해야겠다"라는 생각을 갖고 돌려봤..