sameDashes

  Write a method sameDashes that takes two strings as
   parameters and that returns whether or not they have dashes in the same
   places (returning true if they do and returning false otherwise).  For
   example, below are four pairs of strings of equal length that have the same
   pattern of dashes.  Notice that the last pair has no dashes at all.

        string1:    "hi--there-you."    "-15-389"    "criminal-plan"    "abc"
        string2:    "12--(134)-7539"    "-xy-zzy"    "(206)555-1384"    "9.8"

   To be considered a match, the strings must have exactly the same number of
   dashes in exactly the same positions.  The strings might be of different
   length.  For example, the following calls should each return true:

        sameDashes("1st-has-more characters", "2nd-has-less")
        sameDashes("1st-has-less", "2nd-has-more characters")

   because the strings each have two dashes and they are in the same positions.
   But the following calls should each return false because the longer string
   has a third dash where the shorter string does not:

        sameDashes("1st-has-more-characters", "2nd-has-less")
        sameDashes("1st-has-less", "2nd-has-more-characters")

   Write your solution to sameDashes below.