LeetCode1281. 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

二、题解

class Solution {
public:
    int subtractProductAndSum(int n) {
        int mul = 1;
        int sum = 0;
        while(n){
            int b = n % 10;
            n /= 10;
            mul *= b;
            sum += b;
        }
        return mul - sum;
    }
};

你可能感兴趣的:(算法,数据结构,leetcode,c++)