일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- no sources given
- querydsl no sources given
- Medium
- log error
- OpenFeign
- maybe not public or not valid?
- aws
- java
- JUnit
- java 1.8 11
- property or field 'jobparameters' cannot be found on object of type
- java 여러개 버전
- el1008e
- Java 1.8
- springboottest
- AWS CLI
- No tests found for given includes
- parse
- LeetCode
- java version
- java 11
- springboot
- easy
- yum install java
- springbatch error
- java 버전 변경
- xcrun: error: invalid active developer path (/Library/Developer/CommandLineTools)
- 스프링부트테스트
- error
- mac os git error
- Today
- Total
목록java (7)
쩨이엠 개발 블로그
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); Example 1: Input: s = "PA..
Given the head of a linked list, return the list after sorting it in ascending order. Follow up: Can you sort the linked list in O(n logn) time and O(1) memory (i.e. constant space)? Example 1: Input: head = [4,2,1,3] Output: [1,2,3,4] Example 2: Input: head = [-1,5,3,4,0] Output: [-1,0,3,4,5] Example 3: Input: head = [] Output: [] Constraints: The number of nodes in the list is in the range [0,..
A string S of lowercase English letters is given. We want to partition this string into as many parts as possible so that each letter appears in at most one part, and return a list of integers representing the size of these parts. Example 1: Input: S = "ababcbacadefegdehijhklij" Output: [9,7,8] Explanation: The partition is "ababcbaca", "defegde", "hijhklij". This is a partition so that each let..
Implement the class SubrectangleQueries which receives a rows x cols rectangle as a matrix of integers in the constructor and supports two methods: 1. updateSubrectangle(int row1, int col1, int row2, int col2, int newValue) Updates all values with newValue in the subrectangle whose upper left coordinate is (row1,col1) and bottom right coordinate is (row2,col2). 2. getValue(int row, int col) Retu..
A peak element is an element that is strictly greater than its neighbors. Given an integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks. You may imagine that nums[-1] = nums[n] = -∞. Example 1: Input: nums = [1,2,3,1] Output: 2 Explanation: 3 is a peak element and your function should return the index number 2. ..
Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums. Example 1: Input: nums = [1,2,3,4] Output: [1,3,6,10] Explanation: Running sum is obtained as follows: [1, 1+2, 1+2+3, 1+2+3+4]. Example 2: Input: nums = [1,1,1,1,1] Output: [1,2,3,4,5] Explanation: Running sum is obtained as follows: [1, 1+1, 1+1+1, 1+1+1+1, 1+1+1+1+..
코드를 만드는데 매번 W와 세자리 숫자로 코드값을 넣어야할 때 String.format("W%03d", 24); //W024 W는 String으로 맨 앞에 놓고 %뒤의 숫자는 비었을 경우 넣는 숫자 3은 자릿수 d는 정수를 뜻한다 System.out.println(String.format("%3.3f", 24.2)); //24.200 System.out.println(String.format("%3f", 24.2)); //24.200000 f는 실수를 뜻하며 .를 기준으로 자릿수를 구분한다 .3 은 소숫점 3자리까지를 뜻하며 3.3은 2자리 정수 + 3자리 소숫점을 뜻한다 뒤의 자릿수를 표현하지 않으면 최대한 6자리까지 나온다