Notice
Recent Posts
Recent Comments
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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
- ChatGPT
- 코로나19
- 더현대서울 맛집
- gs25
- Git
- 자연어처리
- Docker
- 데이콘
- github
- programmers
- 파이썬
- 맥북
- 캐치카페
- Kaggle
- 우분투
- 편스토랑
- Baekjoon
- 백준
- 금융문자분석경진대회
- 프로그래머스 파이썬
- PYTHON
- leetcode
- ubuntu
- 프로그래머스
- dacon
- 편스토랑 우승상품
- SW Expert Academy
- Real or Not? NLP with Disaster Tweets
- AI 경진대회
- hackerrank
Archives
- Today
- Total
솜씨좋은장씨
[leetCode] 1281. Subtract the Product and Sum of Digits of an Integer (Python) 본문
Programming/코딩 1일 1문제
[leetCode] 1281. Subtract the Product and Sum of Digits of an Integer (Python)
솜씨좋은장씨 2020. 8. 30. 01:27728x90
반응형
Given an integer number n, return the difference between the product of its digits and the sum of its digits.
Example 1:
Input: n = 234
Output: 15
Explanation:
Product of digits = 2 * 3 * 4 = 24
Sum of digits = 2 + 3 + 4 = 9
Result = 24 - 9 = 15
Example 2:
Input: n = 4421
Output: 21
Explanation:
Product of digits = 4 * 4 * 2 * 1 = 32
Sum of digits = 4 + 4 + 2 + 1 = 11
Result = 32 - 11 = 21
Constraints:
- 1 <= n <= 10^5
Solution
from functools import reduce
class Solution:
@staticmethod
def multiply(arr):
return reduce(lambda x, y: x * y, arr)
def subtractProductAndSum(self, n: int) -> int:
string_n = list(str(n))
n_numbers = list(map(int, string_n))
if len(n_numbers) > 1:
gopsam = self.multiply(n_numbers)
arr_sum = sum(n_numbers)
answer = gopsam - arr_sum
else:
answer = 0
return answer
'Programming > 코딩 1일 1문제' 카테고리의 다른 글
[leetCode] 728. Self Dividing Numbers (Python) (0) | 2020.09.01 |
---|---|
[leetCode] 977. Squares of a Sorted Array (Python) (0) | 2020.09.01 |
[leetCode] 1556. Thousand Separator (Python) (0) | 2020.08.29 |
[leetCode] 709. To Lower Case (Python) (0) | 2020.08.15 |
[leetCode] 263. Ugly Number (Python) (1) | 2020.08.14 |
Comments