일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- java version
- parse
- springboot
- Medium
- yum install java
- error
- springbatch error
- maybe not public or not valid?
- java
- No tests found for given includes
- xcrun: error: invalid active developer path (/Library/Developer/CommandLineTools)
- log error
- no sources given
- java 1.8 11
- java 여러개 버전
- springboottest
- 스프링부트테스트
- AWS CLI
- LeetCode
- querydsl no sources given
- java 11
- aws
- Java 1.8
- JUnit
- OpenFeign
- property or field 'jobparameters' cannot be found on object of type
- mac os git error
- java 버전 변경
- el1008e
- easy
- Today
- Total
목록easy (2)
쩨이엠 개발 블로그
Given an integer x, return true if x is palindrome integer. An integer is a palindrome when it reads the same backward as forward. For example, 121 is palindrome while 123 is not. Example 1: Input: x = 121 Output: true Example 2: Input: x = -121 Output: false Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindrome. Example 3: Input: x..
Given the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn]. Return the array in the form [x1,y1,x2,y2,...,xn,yn]. Example 1: Input: nums = [2,5,1,3,4,7], n = 3 Output: [2,3,5,4,1,7] Explanation: Since x1=2, x2=5, x3=1, y1=3, y2=4, y3=7 then the answer is [2,3,5,4,1,7]. Example 2: Input: nums = [1,2,3,4,4,3,2,1], n = 4 Output: [1,4,2,3,3,2,4,1] Example 3: Input: nums =..