第一次写的递归版本： 点击打开链接，速度太慢了，基本case都超时，重新写一个非递归的
/*given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)/
