LeetCode --- 1281. Subtract the Product and Sum of Digits of an Integer 解题报告
Posted 杨鑫newlfe
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 1281. Subtract the Product and Sum of Digits of an Integer 解题报告相关的知识,希望对你有一定的参考价值。
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
所有代码均可在Github中找到:
# -*- coding:utf-8 -*-
__author__ = \'yangxin_ryan&
以上是关于LeetCode --- 1281. Subtract the Product and Sum of Digits of an Integer 解题报告的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode --- 1281. Subtract the Product and Sum of Digits of an Integer 解题报告
算法1281. 整数的各位积和之差(java / c / c++ / python / go / rust)