2016 年 3月 16 日随笔档案 - ArgenBarbie

2016年3月16日

摘要： Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n). For example,S = "ADOBECOD 阅读全文

posted @ 2016-03-16 19:23 ArgenBarbie 阅读(115) 评论(0) 推荐(0)

74. Search a 2D Matrix

摘要： Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: For example, Consider the followi 阅读全文

posted @ 2016-03-16 17:16 ArgenBarbie 阅读(197) 评论(0) 推荐(0)

73. Set Matrix Zeroes

摘要： Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. Did you use extra space?A straight forward solution usin 阅读全文

posted @ 2016-03-16 17:11 ArgenBarbie 阅读(156) 评论(0) 推荐(0)

72. Edit Distance *HARD*

摘要： 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 @ 2016-03-16 16:40 ArgenBarbie 阅读(179) 评论(0) 推荐(0)