일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- 게임
- 알고리즘테스트
- 노노그램
- 송리단
- javascript
- 메탈퍼즐
- 발더스게이트
- 맛집
- 미앤아이
- 코테
- 코딩테스트
- 취미
- 밥먹고
- 나쫌
- 3d퍼즐
- 하스스톤
- 토이프로젝트
- 뜨아거
- 잠실새내
- 천등
- 발더스모드
- 서울제빵소
- 버즈2프로
- DIY
- 누룽지소금빵
- 발더스3
- 바질토마토뭐시기
- 눈알빠지겠네
- 메일우유
- LeetCode
- Today
- Total
목록2023/10 (6)
.Zzumbong
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/zIB3N/btsw2FqTD6f/UTt3IQfJcC3ef2Z17fYCFk/img.png)
난이도 [ 🤔 ] Medium 문제 설명 Given an integer n, break it into the sum of k positive integers, where k >= 2, and maximize the product of those integers. Return the maximum product you can get. 입출력 예 Example 1: Input: n = 2 Output: 1 Explanation: 2 = 1 + 1, 1 × 1 = 1. Example 2: Input: n = 10 Output: 36 Explanation: 10 = 3 + 3 + 4, 3 × 3 × 4 = 36. Constraints 2
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/cLaMc6/btswkpnM5lT/Vbg4pPgLiMCD0dPdYIQSqk/img.png)
난이도 [ 😊 ] Easy 문제 설명 Design a HashMap without using any built-in hash table libraries. Implement the MyHashMap class: MyHashMap() initializes the object with an empty map. void put(int key, int value) inserts a (key, value) pair into the HashMap. If the key already exists in the map, update the corresponding value. int get(int key) returns the value to which the specified key is mapped, or -1 if..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/Zdmp5/btsv8ip2SBU/fOLBHF9mn8TlH8r0vtfPwK/img.png)
난이도 [ 🤔 ] Medium 문제 설명 The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H N A P L S I I G Y I R And then read line by line: "PAHNAPLSIIGYIR" Write the code that will take a string and make this conversion given a number of rows: string convert(string s, int numRows); 입출..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/bipvXm/btswasSTc8y/ookTmJ2S1XsuPOEIesLGmK/img.png)
난이도 [ 😊 ] Easy 문제 설명 Given an array of integers nums, return the number of good pairs. A pair (i, j) is called good if nums[i] == nums[j] and i < j. 정수 nums 배열을 받아서 good pairs 를 리턴한다. good pair 는 nums[i] === nums[j] 이다. i < j 는 해당하지 않음.. 문제가 좀 이상하긴해 입출력 예 Example 1: Input: nums = [1,2,3,1,1,3] Output: 4 Explanation: There are 4 good pairs (0,3), (0,4), (3,4), (2,5) 0-indexed. Example 2: Input: n..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/benlNG/btswwRcHzcU/NdooL25GjJP9u8WeEEFItk/img.png)
난이도 [ 🤔 ] Medium 문제 설명 There are n pieces arranged in a line, and each piece is colored either by 'A' or by 'B'. You are given a string colors of length n where colors[i] is the color of the ith piece. Alice and Bob are playing a game where they take alternating turns removing pieces from the line. In this game, Alice moves first. Alice is only allowed to remove a piece colored 'A' if both its n..
![](http://i1.daumcdn.net/thumb/C150x150/?fname=https://blog.kakaocdn.net/dn/zbhvY/btsv7zyjIp0/ouXphnS1fn8CQ4TgAleZxK/img.png)
난이도 [ 😊 ] Easy 문제 설명 Given a string s, reverse the order of characters in each word within a sentence while still preserving whitespace and initial word order. 문자열 s가 주어지면 공백과 단어 순서를 그대로 유지하면서 단어의 문자 순서를 반대로 바꾼다. 입출력 예 Example 1: Input: s = "Let's take LeetCode contest" Output: "s'teL ekat edoCteeL tsetnoc" Example 2: Input: s = "God Ding" Output: "doG gniD" Constraints 1