morframe-优快云博客

原创【leetcode】Minimum Window Substring

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 "BAN

2016-05-13 18:40:38 222

原创【leetcode】Surrounded Regions

Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'. A region is captured by flipping all 'O's into 'X's in that surrounded region. For example, X X X X X O O X

2016-05-13 16:09:14 305

原创【leetcode】Search in Rotated Sorted Array

Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You are given a target value to search. If found in the array retur

2016-05-13 10:19:30 245

原创【leetcode】Word Break

Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words. For example, given s = "leetcode", dict = ["leet"

2016-05-04 21:41:16 225

原创【Leetcode】Word Search

Given a 2D board and a word, find if the word exists in the grid. The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertical

2016-05-04 15:56:35 164

原创【leetcode】Median of Two Sorted Arrays

There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). 思路：将求解转换为求第k小元素的问题代码

2016-05-04 11:11:51 193

原创【leetcode】Word Ladder

leetcode word ladder

2016-05-03 14:29:42 329

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人