FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
leetcode/src/integerToRoman/integerToRoman.cpp at master · cobain/leetcode · GitHub
cobain
/
leetcode
Public
forked from
haoel/leetcode
Notifications
You must be signed in to change notification settings
Fork
0
Star
1
Code
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
leetcode
/
src
/
integerToRoman
/
integerToRoman.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
44 lines (36 loc) · 1.05 KB
Breadcrumbs
leetcode
/
src
/
integerToRoman
/
integerToRoman.cpp
Copy path
File metadata and controls
44 lines (36 loc) · 1.05 KB
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
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://oj.leetcode.com/problems/integer-to-roman/
//
Author : Hao Chen
//
Date : 2014-07-17
/*
*********************************************************************************
*
* Given an integer, convert it to a roman numeral.
*
* Input is guaranteed to be within the range from 1 to 3999.
*
*********************************************************************************
*/
#
include
<
stdlib.h
>
#
include
<
string
>
#
include
<
iostream
>
using
namespace
std
;
//
greeding algorithm
string
intToRoman
(
int
num) {
string symbol[] = {
"
M
"
,
"
CM
"
,
"
D
"
,
"
CD
"
,
"
C
"
,
"
XC
"
,
"
L
"
,
"
XL
"
,
"
X
"
,
"
IX
"
,
"
V
"
,
"
IV
"
,
"
I
"
};
int
value[] = {
1000
,
900
,
500
,
400
,
100
,
90
,
50
,
40
,
10
,
9
,
5
,
4
,
1
};
string result;
for
(
int
i=
0
; num!=
0
; i++){
while
(num >= value[i]){
num -= value[i];
result+=symbol[i];
}
}
return
result;
}
int
main
(
int
argc,
char
** argv)
{
int
num =
1234
;
if
(argc>
0
){
num =
atoi
(argv[
1
]);
}
cout << num <<
"
:
"
<<
intToRoman
(num) << endl;
return
0
;
}
Back
|
FazBrowse Home
|
New Git URL