Comment
Raj
More Enhacement To The Solution..,
September 25, 2008 at 1:03 AM
September 25, 2008 at 1:03 AM
import java.util.HashMap;
public class NumberToWords{
static final String[] Number1 = {""," Hundred"};
static final String[] Number2 = {"","One","Two", "Three","Four","Five", " Six"," Seven", "Eight"," Nine","Ten" };
static HashMap<Integer,String> numHash = new HashMap<Integer,String> ();
String number(int number){
String str;
if (number % 100 < 10){
str = Number2[number % 100];
number /= 100;
}
else{
if( (number % 10) == 0){
return Number2[number / 10] + " zero";
}
else{
str = Number2[number % 10];
number /= 10;
if (number == 0) return str ;
return Number2[number] + " " + str;
}
}
if (number == 0) return str;
return Number2[number] + "hundred" + str;
}
private void setHash(){
numHash.put(11, "Eleven");
numHash.put(12, "Twelve");
numHash.put(13, "Thirteen");
numHash.put(14, "Fourteen");
numHash.put(15, "Fifteen");
numHash.put(16, "Sixteen");
numHash.put(17, "Seventeen");
numHash.put(18, "Eighteen");
numHash.put(19, "Nineteen");
}
private String convert(int number) {
if(number < 0 || number > 999)
return "Invalid Number - Should be (0-999)";
if (number == 0){
return "zero";
}
String pre = "";
String str1 = "";
int i = 0;
if( (number > 10 && number < 19)){
return numHash.get(number);
}else{
do {
int n = number % 100;
if (n != 0){
String s = number(n);
str1 = s + Number1[i] + str1;
}
i++;
number /= 100;
}
while (number > 0);
}
return (pre + str1).trim();
}
public static void main(String[] args) {
NumberToWords num = new NumberToWords();
num.setHash();
System.out.println("words is :=" + num.convert(10));
System.out.println("words is :=" + num.convert(200));
System.out.println("words is :=" + num.convert(999));
System.out.println("words is :=" + num.convert(20));
System.out.println("words is :=" + num.convert(179));
System.out.println("words is :=" + num.convert(44));
System.out.println("words is :=" + num.convert(-12));
System.out.println("words is :=" + num.convert(9221));
}
}
View All Comments | View Tutorial
public class NumberToWords{
static final String[] Number1 = {""," Hundred"};
static final String[] Number2 = {"","One","Two", "Three","Four","Five", " Six"," Seven", "Eight"," Nine","Ten" };
static HashMap<Integer,String> numHash = new HashMap<Integer,String> ();
String number(int number){
String str;
if (number % 100 < 10){
str = Number2[number % 100];
number /= 100;
}
else{
if( (number % 10) == 0){
return Number2[number / 10] + " zero";
}
else{
str = Number2[number % 10];
number /= 10;
if (number == 0) return str ;
return Number2[number] + " " + str;
}
}
if (number == 0) return str;
return Number2[number] + "hundred" + str;
}
private void setHash(){
numHash.put(11, "Eleven");
numHash.put(12, "Twelve");
numHash.put(13, "Thirteen");
numHash.put(14, "Fourteen");
numHash.put(15, "Fifteen");
numHash.put(16, "Sixteen");
numHash.put(17, "Seventeen");
numHash.put(18, "Eighteen");
numHash.put(19, "Nineteen");
}
private String convert(int number) {
if(number < 0 || number > 999)
return "Invalid Number - Should be (0-999)";
if (number == 0){
return "zero";
}
String pre = "";
String str1 = "";
int i = 0;
if( (number > 10 && number < 19)){
return numHash.get(number);
}else{
do {
int n = number % 100;
if (n != 0){
String s = number(n);
str1 = s + Number1[i] + str1;
}
i++;
number /= 100;
}
while (number > 0);
}
return (pre + str1).trim();
}
public static void main(String[] args) {
NumberToWords num = new NumberToWords();
num.setHash();
System.out.println("words is :=" + num.convert(10));
System.out.println("words is :=" + num.convert(200));
System.out.println("words is :=" + num.convert(999));
System.out.println("words is :=" + num.convert(20));
System.out.println("words is :=" + num.convert(179));
System.out.println("words is :=" + num.convert(44));
System.out.println("words is :=" + num.convert(-12));
System.out.println("words is :=" + num.convert(9221));
}
}
View All Comments | View Tutorial
Related Tutorial and Articles
If you are facing any programming issue, such as compilation errors or not able to find the code you are looking for.
Ask your questions, our development team will try to give answers to your questions.
Tutorial Topics
