일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- 인프런
- 스텍
- js
- 백준
- java
- 삼성
- 카카오
- 알고리즘
- 코테준비
- 콜백지옥
- mybatis
- 코딩
- stack
- 정렬
- 프로그래머스
- 코테
- spring
- NestJS
- 삼성소프트웨어아카데미
- 자바스크립트
- SWEA
- 그리디알고리즘
- 중간 평균값 구하기
- AtoZ0403
- javascript
- 코딩테스트
- array
- 자바
- 자료구조
- 배열
- Today
- Total
목록배열 (3)
개발에 AtoZ까지
1. 문제 Given a non-empty array of digits representing a non-negative integer, plus one to the integer. The digits are stored such that the most significant digit is at the head of the list, and each element in the array contain a single digit. You may assume the integer does not contain any leading zero, except the number 0 itself. Example 1: Input: [1,2,3] Output: [1,2,4] Explanation: The array ..
1. 문제 We have a list of points on the plane. Find the K closest points to the origin (0, 0). (Here, the distance between two points on a plane is the Euclidean distance.) You may return the answer in any order. The answer is guaranteed to be unique (except for the order that it is in.) Example 1: Input: points = [[1,3],[-2,2]], K = 1 Output: [[-2,2]] Explanation: The distance between (1, 3) and ..
1. 문제 Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. Example: Input: [0,1,0,3,12] Output: [1,3,12,0,0] Note: You must do this in-place without making a copy of the array. Minimize the total number of operations. 2. 문제해설 숫자들이 주어졌을때 숫자간의 순서는 유지하되 0만 맨끝쪽으로 이동시키게 하라 3. 코드포맷 public class MoveZeros { public static v..