일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- 모두의 꿈
- 정렬
- 백준
- lgb
- 코테
- T tree
- 힙 정렬
- BFS
- 코딩테스트
- 스펨메일 분류
- 27448
- 코딩
- 2247
- 코복장
- 아니메컵
- C
- 다이나믹 프로그래밍
- python
- 실질적 약수
- dp
- ps
- 구현
- 파이썬
- populating next right pointers in each node
- 샤논 엔트로피
- dfs
- 부분수열의 합2
- 정답코드
- 17070
- 딥러닝
- Today
- Total
목록코딩 테스트/python(파이썬) (57)
코딩복습장

You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).Find two lines that together with the x-axis form a container, such that the container contains the most water.Return the maximum amount of water a container can store.Notice that you may not slant the container. Example 1:Input: height = [..

Given a circular array nums, find the maximum absolute difference between adjacent elements.Note: In a circular array, the first and last elements are adjacent. Example 1:Input: nums = [1,2,4]Output: 3Explanation:Because nums is circular, nums[0] and nums[2] are adjacent. They have the maximum absolute difference of |4 - 1| = 3.Example 2:Input: nums = [-5,-10,-5]Output: 5Explanation:The adjacent..

You are given an integer num. You know that Bob will sneakily remap one of the 10 possible digits (0 to 9) to another digit.Return the difference between the maximum and minimum values Bob can make by remapping exactly one digit in num.Notes:When Bob remaps a digit d1 to another digit d2, Bob replaces all occurrences of d1 in num with d2.Bob can remap a digit to itself, in which case num does no..

Given a 0-indexed integer array nums of size n, find the maximum difference between nums[i] and nums[j] (i.e., nums[j] - nums[i]), such that 0 and nums[i] Return the maximum difference. If no such i and j exists, return -1. Example 1:Input: nums = [7,1,5,4]Output: 4Explanation:The maximum difference occurs with i = 1 and j = 2, nums[j] - nums[i] = 5 - 1 = 4.Note that with i = 1 and j = 0, the d..