2015 年 9月 21 日随笔档案 - Dylan_Java_NYC

2015年9月21日

摘要：原题链接在这里：https://leetcode.com/problems/edit-distance/ 题目： Given two words word1 and word2, find the minimum number of steps required to convert word1 t 阅读全文

posted @ 2015-09-21 09:31 Dylan_Java_NYC 阅读(424) 评论(0) 推荐(0)

LeetCode Scramble String

摘要：原题链接在这里：https://leetcode.com/problems/scramble-string/这道题参考了这篇帖子：http://blog.csdn.net/linhuanmars/article/details/24506703这其实是一道三维动态规划的题目，我们提出维护量res[i... 阅读全文

posted @ 2015-09-21 08:44 Dylan_Java_NYC 阅读(199) 评论(0) 推荐(0)

LeetCode 22. Generate Parentheses

摘要：原题链接在这里：https://leetcode.com/problems/generate-parentheses/ 题目： Given n pairs of parentheses, write a function to generate all combinations of well-fo 阅读全文

posted @ 2015-09-21 07:15 Dylan_Java_NYC 阅读(246) 评论(0) 推荐(0)

LeetCode 151. Reverse Words in a String

摘要：原题链接在这里：https://leetcode.com/problems/reverse-words-in-a-string/ 题目： Given an input string, reverse the string word by word. For example,Given s = "th 阅读全文

posted @ 2015-09-21 04:42 Dylan_Java_NYC 阅读(272) 评论(0) 推荐(0)

LeetCode 71. Simplify Path

摘要：原题链接在这里：https://leetcode.com/problems/simplify-path/ 题目： Given an absolute path for a file (Unix-style), simplify it. For example,path = "/home/", => 阅读全文

posted @ 2015-09-21 04:11 Dylan_Java_NYC 阅读(245) 评论(0) 推荐(0)

公告