• Post Reply Bookmark Topic Watch Topic
  • New Topic

phone number problem  RSS feed

 
lex luther
Greenhorn
Posts: 1
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Hi, I got a phone number problem. I get a list of phone numbers and a word file containing words, how could I need to see if I could match the phone number to 7 letter words, then see if I can match the first 3 numbers to 3 letter words and then the last 4 numbers to 4 number words. I figured all that out so far. The last part of this assignment is to see if I could match a combination of words together to match the phone numbers.
Example:
531 3259
IGETMILK
 
Winston Gutkowski
Bartender
Posts: 10575
66
Eclipse IDE Hibernate Ubuntu
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
lex luther wrote:I figured all that out so far. The last part of this assignment is to see if I could match a combination of words together to match the phone numbers.
Example:
531 3259
IGETMILK

Erm ... ???

IGETMILK has eight characters.

I think you need to explain the problem a bit more clearly (for yourself as much as anything) before you write too much code.
However, my suggestion would be to simply convert your "words" to numbers and match them up that way, rather than trying to see whether there's a word that can be made from a telephone number, since each 'digit' has either 3 or 4 possible interpretations as a "letter", but a letter can only be one number.

Also: One quick check would be to see if the number contains any '0's or '1's, since neither has any equivalent letter. ('O' is 6 and 'I' is 4 - at least on my phone).

HIH

Winston
 
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
Boost this thread!