原创 Lintcode118 Distinct Subsequences solution 題解

【題目描述】 Given a stringSand a stringT, count the number of distinct subsequences ofTinS. A subsequence of a string is a ne

原创 MICROSOFT 面經

前一段時間我參加了Microsoft的招聘。整個面試的過程很長,歷時兩個多月,和許多優秀的競爭者一起廝殺,最終進入了Microsoft。 Online test 時間非常緊,題量很大。時長90分鐘,前面半個小時問了一些常見的問題,後面一小時

原创 Lintcode115 Unique Paths || solution 題解

【題目描述】 Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would

原创 Lintcode119 Edit Distance solution 題解

【題目描述】 Given two wordsword1andword2, find the minimum number of steps required to convert word1 to word2. (each operatio

原创 Lintcode117 Jump Game || solution 題解

【題目描述】 Given an array of non-negative integers, you are initially positioned at the first index of the array. Each eleme

原创 Lintcode116 Jump Game solution 題解

【題目描述】 Given an array of non-negative integers, you are initially positioned at the first index of the array. Each eleme

原创 Lintcode116 Jump Game solution 題解

【題目描述】 Given an array of non-negative integers, you are initially positioned at the first index of the array. Each eleme

原创 Lintcode117 Jump Game || solution 題解

【題目描述】 Given an array of non-negative integers, you are initially positioned at the first index of the array. Each eleme

原创 Lintcode115 Unique Paths || solution 題解

【題目描述】 Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would

原创 Lintcode118 Distinct Subsequences solution 題解

【題目描述】 Given a stringSand a stringT, count the number of distinct subsequences ofTinS. A subsequence of a string is a ne