FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/C++/minimum-factorization.cpp at master · tehsints/LeetCode-Solutions · GitHub
tehsints
/
LeetCode-Solutions
Public
forked from
kamyu104/LeetCode-Solutions
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
LeetCode-Solutions
/
C++
/
minimum-factorization.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
21 lines (19 loc) · 479 Bytes
Breadcrumbs
LeetCode-Solutions
/
C++
/
minimum-factorization.cpp
Copy path
File metadata and controls
21 lines (19 loc) · 479 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
//
Time: O(loga)
//
Space: O(1)
class
Solution
{
public:
int
smallestFactorization
(
int
a) {
if
(a <
2
) {
return
a;
}
long
result =
0
, mul =
1
;
for
(
int
i =
9
; i >=
2
; --i) {
while
(a % i ==
0
) {
a /= i;
result = mul * i + result;
mul *=
10
;
}
}
return
a ==
1
&& result <= numeric_limits<
int
>::
max
() ?
static_cast
<
int
>(result) :
0
;
}
};
Back
|
FazBrowse Home
|
New Git URL