반응형
Notice
Recent Posts
Recent Comments
Link
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
Tags
- property or field 'jobparameters' cannot be found on object of type
- xcrun: error: invalid active developer path (/Library/Developer/CommandLineTools)
- LeetCode
- AWS CLI
- no sources given
- java 버전 변경
- springboot
- java 11
- Java 1.8
- java 1.8 11
- mac os git error
- java 여러개 버전
- OpenFeign
- springboottest
- querydsl no sources given
- java version
- el1008e
- parse
- aws
- java
- Medium
- 스프링부트테스트
- log error
- maybe not public or not valid?
- easy
- yum install java
- JUnit
- No tests found for given includes
- error
- springbatch error
Archives
- Today
- Total
목록Partitioning Into Minimum Number Of Deci-Binary Numbers (1)
쩨이엠 개발 블로그
[ Leetcode ] 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers - Java
A decimal number is called deci-binary if each of its digits is either 0 or 1 without any leading zeros. For example, 101 and 1100 are deci-binary, while 112 and 3001 are not. Given a string n that represents a positive decimal integer, return the minimum number of positive deci-binary numbers needed so that they sum up to n. Example 1: Input: n = "32" Output: 3 Explanation: 10 + 11 + 11 = 32 Ex..
개발/Programming
2021. 1. 30. 09:48