摘要:
Given a string containing only digits, restore it by returning all possible valid IP address combinations.For example:Given"25525511135",return["255.255.11.135", "255.255.111.35"]. (Order does not matter)[解题思路]DFS + Backtracking给定的字符串分成4段,每段都0 剩余段数*32.剩余位数 restoreIpAddr 阅读全文
posted @ 2013-09-04 19:50
feiling
阅读(746)
评论(1)
推荐(0)
摘要:
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="ADOBECODEBANC"T="ABC"Minimum window is"BANC".Note:If there is no such window in S that covers all characters in T, return the emtpy 阅读全文
posted @ 2013-09-04 17:01
feiling
阅读(857)
评论(0)
推荐(0)
浙公网安备 33010602011771号