摘要: 题目: Given two strings S and T, determine if they are both one edit distance apart. 链接: http://leetcode.com/problems/one-edit-distance/ 6/14/2017 2ms, 阅读全文
posted @ 2017-06-14 20:15 panini 阅读(149) 评论(0) 推荐(0) 编辑
摘要: 题目: Given a binary tree where all the right nodes are either leaf nodes with a sibling (a left node that shares the same parent node) or empty, flip i 阅读全文
posted @ 2017-06-14 19:39 panini 阅读(143) 评论(0) 推荐(0) 编辑
摘要: 题目: 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). Find the minimum elem 阅读全文
posted @ 2017-06-14 05:40 panini 阅读(107) 评论(0) 推荐(0) 编辑
摘要: 题目: Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,3,-2, 阅读全文
posted @ 2017-06-14 01:53 panini 阅读(130) 评论(0) 推荐(0) 编辑