摘要: Given two words word1 and word2, find the minimum number of steps required to make word1 and word2 the same, where in each step you can delete one cha 阅读全文
posted @ 2018-11-05 21:06 C`Moriarty 阅读(123) 评论(0) 推荐(0) 编辑
摘要: Given a list of strings, you need to find the longest uncommon subsequence among them. The longest uncommon subsequence is defined as the longest subs 阅读全文
posted @ 2018-11-05 21:00 C`Moriarty 阅读(144) 评论(0) 推荐(0) 编辑
/* 鼠标点击求赞文字特效 */ /*鼠标跟随效果*/