In OCaml
let explode str =
let rec aux pos acc =
if pos < 0 then acc
else aux (pred pos) (str.[pos] :: acc)
in aux ((String.length str)-1) []
let d2a = function
| 'M' -> 1000
| 'D' -> 500
| 'C' -> 100
| 'L' -> 50
| 'X' -> 10
| 'V' -> 5
| 'I' -> 1
| _ -> failwith "Incorrect character"
let r2d str =
List.fold_left (fun acc x -> let x' = d2a x in acc + x' - acc mod
+x' * 2) 0 (explode (String.uppercase str));;
- explode just converts a string into a list of its characters. The future standard library for OCaml, named Batteries included will include such a function by default.
- The functional nature of OCaml allows a natural implementation of the algorithm
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|