Fork me on GitHub
摘要: 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.) You have 阅读全文
posted @ 2017-03-14 20:20 hellowOOOrld 阅读(158) 评论(0) 推荐(0)
摘要: Given two binary strings, return their sum (also a binary string). For example, a = "11" b = "1" Return "100". 思路: 模拟加法时候的情形,从最后一位开始进行相加,注意进位的情况。 阅读全文
posted @ 2017-03-14 15:44 hellowOOOrld 阅读(152) 评论(0) 推荐(0)