\n
input: 123, <\/p>\n\n\n\n
expected: “one hundred twenty-three”,<\/p>\n<\/div><\/div>\n\n\n\n
For every such input number you need to translate and provide the English output.<\/p>\n\n\n\n
The max limit goes till out a 100 billion.<\/p>\n\n\n\n
I started it with a standard map definition which has few constants already in place.<\/p>\n\n\n\n
var myMap = map[int]string{\n 0: \"zero\", \/\/ 0 - Starts with zero.\n 1: \"one\",\n 2: \"two\",\n 3: \"three\",\n 4: \"four\",\n 5: \"five\",\n 6: \"six\",\n 7: \"seven\",\n 8: \"eight\",\n 9: \"nine\",\n 10: \"ten\",\n 11: \"eleven\",\n 12: \"twelve\",\n 13: \"thirteen\",\n 20: \"twenty\",\n 30: \"thirty\",\n 40: \"fourty\",\n 50: \"fifty\",\n 60: \"sixty\",\n 70: \"seventy\",\n 80: \"eighty\",\n 90: \"ninety\",\n 100: \"hundred\",\n 1000: \"thousand\",\n 1000000: \"million\",\n 1000000000: \"billion\",\n}<\/pre>\n\n\n\nStep – 1<\/h2>\n\n\n\n
Addressing all numbers less than 100.<\/p>\n\n\n\n
\/\/tens It is a function that will convert < 100\nfunc tens<\/strong>(i int) (string, bool) {\n\n \/\/ Valid for numbers less than hundred only.\n switch {\n case i > 13 && i < 20:\n return fmt.Sprintf(\"%s%s\", myMap[i-10], \"teen\"), true\n case i > 20 && i < 29:\n return fmt.Sprintf(\"%s%s\", \"twenty-\", myMap[i-20]), true\n case i > 30 && i < 40:\n return fmt.Sprintf(\"%s%s\", \"thirty-\", myMap[i-30]), true\n case i > 40 && i < 50:\n return fmt.Sprintf(\"%s%s\", \"forty-\", myMap[i-40]), true\n case i > 50 && i < 60:\n return fmt.Sprintf(\"%s%s\", \"fifty-\", myMap[i-50]), true\n case i > 60 && i < 70:\n return fmt.Sprintf(\"%s%s\", \"sixty-\", myMap[i-60]), true\n case i > 70 && i < 80:\n return fmt.Sprintf(\"%s%s\", \"seventy-\", myMap[i-70]), true\n case i > 80 && i < 90:\n return fmt.Sprintf(\"%s%s\", \"eighty-\", myMap[i-80]), true\n case i > 90 && i < 100:\n return fmt.Sprintf(\"%s%s\", \"ninety-\", myMap[i-90]), true\n default:\n \/\/ If there is a numeric equivalent available in map.\n if val, ok := myMap[int(i)]; ok {\n return val, true\n }\n }\n\n \/\/No match found in map or can be calculated\n return \"\", false\n}<\/pre>\n\n\n\nNow time to build the logic upwards<\/p>\n\n\n\n
\/\/NumberConversion Converts the number\nfunc NumberConversion<\/strong>(i int64) (string, bool) {\n var s strings.Builder\n\n for i >= 0 {\n switch {\n case i == 0:\n if len(s.String()) == 0 {\n if val, ok := tens(int(i)); ok {\n fmt.Fprintf(&s, \" %s\", val)\n }\n }\n return strings.TrimSpace(s.String()), true\n case i < 100:\n if val, ok := tens(int(i)); ok {\n fmt.Fprintf(&s, \" %s\", val)\n }\n return strings.TrimSpace(s.String()), true\n }\n }\n return \"\", false\n}<\/pre>\n\n\n\nThis function allows all number conversion for elements less than 100 by calling the NumberConversion<\/code> function.<\/p>\n\n\n\nStep – 2 Number > 100 < 1000<\/h2>\n\n\n\n
Added a hundreds function<\/p>\n\n\n\n
\/\/ hundreds Allows to compute the numeric equivalent of the 100-999\nfunc hundreds<\/strong>(r int) (string, bool) {\n switch {\n case r == 0:\n return fmt.Sprintf(\"one %s\", myMap[100]), true\n default:\n return fmt.Sprintf(\"%s %s\", myMap[r], myMap[100]), true\n }\n}<\/pre>\n\n\n\nand adding a new case to the function NumberConversion<\/code><\/p>\n\n\n\n case i >= 100 && i < 1000:\n r := int(i \/ 100)\n if val, ok := hundreds(r); ok {\n fmt.Fprintf(&s, \" %s\", val)\n }\n i %= 100<\/pre>\n\n\n\nSimilarly for elements greater than 1000<\/p>\n\n\n\n
case i >= 1000 && i < 1000000:\n r := i \/ 1000\n if val, ok := NumberConversion(r); ok {\n fmt.Fprintf(&s, \" %s %s\", val, myMap[1000])\n }\n i %= 1000<\/pre>\n\n\n\nFor elements greater than million<\/p>\n\n\n\n
case i >= 1000000 && i < 1000000000:\n r := i \/ 1000000\n if val, ok := NumberConversion(r); ok {\n fmt.Fprintf(&s, \" %s %s\", val, myMap[1000000])\n }\n i %= 1000000<\/pre>\n\n\n\nAnd the last billion and less than 100 billion.<\/p>\n\n\n\n
case i >= 1000000000 && i < 1000000000000:\n r := i \/ 1000000000\n if val, ok := NumberConversion(r); ok {\n fmt.Fprintf(&s, \"%s %s\", val, myMap[1000000000])\n }\n i %= 1000000000<\/pre>\n\n\n\nFinally the function looks like below<\/p>\n\n\n\n
\/\/NumberConversion Converts the number\nfunc NumberConversion<\/strong>(i int64) (string, bool) {\n var s strings.Builder\n\n for i >= 0 {\n switch {\n case i == 0:\n if len(s.String()) == 0 {\n if val, ok := tens(int(i)); ok {\n fmt.Fprintf(&s, \" %s\", val)\n }\n }\n return strings.TrimSpace(s.String()), true\n case i < 100:\n if val, ok := tens(int(i)); ok {\n fmt.Fprintf(&s, \" %s\", val)\n }\n return strings.TrimSpace(s.String()), true\n case i >= 100 && i < 1000:\n r := int(i \/ 100)\n if val, ok := hundreds(r); ok {\n fmt.Fprintf(&s, \" %s\", val)\n }\n i %= 100\n case i >= 1000 && i < 1000000:\n r := i \/ 1000\n if val, ok := NumberConversion(r); ok {\n fmt.Fprintf(&s, \" %s %s\", val, myMap[1000])\n }\n i %= 1000\n case i >= 1000000 && i < 1000000000:\n r := i \/ 1000000\n if val, ok := NumberConversion(r); ok {\n fmt.Fprintf(&s, \" %s %s\", val, myMap[1000000])\n }\n i %= 1000000\n case i >= 1000000000 && i < 1000000000000:\n r := i \/ 1000000000\n if val, ok := NumberConversion(r); ok {\n fmt.Fprintf(&s, \"%s %s\", val, myMap[1000000000])\n }\n i %= 1000000000\n }\n }\n return \"\", false\n}\n<\/pre>\n\n\n\n- All code available here<\/a> <\/li><\/ul>\n\n\n\n
— THE – END —<\/h2>\n\n\n\n
<\/p>\n","protected":false},"excerpt":{"rendered":"
With the Corona-Lockdown in place “literally”, it was time to squeeze out some me-time to continue the quest for GO-Proficiency. Sometimes you re-do optimization in your head so many times that it takes a whole day to see through the mistake you are making. Trying to solve problem – Say. input: 123, expected: “one hundred […]<\/p>\n","protected":false},"author":1,"featured_media":488,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_exactmetrics_skip_tracking":false,"_exactmetrics_sitenote_active":false,"_exactmetrics_sitenote_note":"","_exactmetrics_sitenote_category":0,"footnotes":""},"categories":[34],"tags":[23],"class_list":["post-487","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-technical","tag-golang"],"_links":{"self":[{"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/posts\/487","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/comments?post=487"}],"version-history":[{"count":0,"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/posts\/487\/revisions"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/media\/488"}],"wp:attachment":[{"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/media?parent=487"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/categories?post=487"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blog.samarthya.me\/wps\/wp-json\/wp\/v2\/tags?post=487"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}