일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | ||||
4 | 5 | 6 | 7 | 8 | 9 | 10 |
11 | 12 | 13 | 14 | 15 | 16 | 17 |
18 | 19 | 20 | 21 | 22 | 23 | 24 |
25 | 26 | 27 | 28 | 29 | 30 | 31 |
- 버즈2프로
- 발더스게이트
- 알고리즘테스트
- 발더스모드
- 뜨아거
- 메일우유
- 노노그램
- 나쫌
- DIY
- 잠실새내
- 맛집
- 코딩테스트
- 코테
- 밥먹고
- 눈알빠지겠네
- 취미
- 하스스톤
- javascript
- 메탈퍼즐
- LeetCode
- 발더스3
- 누룽지소금빵
- 미앤아이
- 바질토마토뭐시기
- 토이프로젝트
- 송리단
- 3d퍼즐
- 천등
- 서울제빵소
- 게임
- Today
- Total
목록2022/12/14 (2)
.Zzumbong
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/ca8ofE/btrTyCMHYC0/PsLgkhROMC5kZ6zvYqKHTK/img.png)
난이도 [ 🤔 ] Medium 문제 설명 Given an integer array nums, find a subarray that has the largest product, and return the product. The test cases are generated so that the answer will fit in a 32-bit integer. 연속된 element 중 곱했을 때, 가장큰 수를 return 한다. 입출력 예 Example 1: Input: nums = [2,3,-2,4] Output: 6 Explanation: [2,3] has the largest product 6. Example 2: Input: nums = [-2,0,-1] Output: 0 Explanation: The..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/tQ7oJ/btrTDk4yCw8/ApsM3Kufy3XJWsantRX2ck/img.png)
난이도 [ 🤔 ] Medium 문제 설명 You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night. Given an integer array nums represent..