-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1281.go
44 lines (41 loc) · 1.14 KB
/
1281.go
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
32
33
34
35
36
37
38
39
40
41
42
43
44
// Source: https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer
// Title: Subtract the Product and Sum of Digits of an Integer
// Difficulty: Easy
// Author: Mu Yang <http://muyang.pro>
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// 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
//
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
package main
func subtractProductAndSum(n int) int {
sum := 0
prod := 1
for ; n > 0; n /= 10 {
d := n % 10
sum += d
prod *= d
}
return prod - sum
}