Idiot-maker

摘要： https://leetcode.com/problems/minimum-window-substring/ Given a string S and a string T, find the minimum window in S which will contain all the chara 阅读全文

摘要： https://leetcode.com/problems/text-justification/Given an array of words and a lengthL, format the text such that each line has exactlyLcharacters and... 阅读全文

摘要： https://leetcode.com/problems/valid-number/Validate if a given string is numeric.Some examples:"0"=>true" 0.1 "=>true"abc"=>false"1 a"=>false"2e10"=>t... 阅读全文

摘要： https://leetcode.com/problems/sqrtx/Implementint sqrt(int x).Compute and return the square root ofx.解题思路：这道题的题意是，算出最接近sqrt(x)的整数，正好等于或者略小于。这里注意的是，不能mi... 阅读全文

摘要： https://leetcode.com/problems/wildcard-matching/Implement wildcard pattern matching with support for'?'and'*'.'?' Matches any single character.'*' Mat... 阅读全文