Youth is not a time of life; it is a state of mind.

Search for a Range

Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm’s runtime complexity must be in the or...

2015-11-17 16:46:47

阅读数 374

评论数 1

Search in Rotated Sorted Array II

Follow up for “Search in Rotated Sorted Array”: What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a functi...

2015-11-17 16:45:51

阅读数 316

评论数 0

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 val...

2015-11-17 16:44:51

阅读数 308

评论数 0

Search Insert Position

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in o...

2015-11-17 16:43:36

阅读数 328

评论数 0

Subsets II

Given a collection of integers that might contain duplicates, nums, return all possible subsets.Note: Elements in a subset must be in non-descending...

2015-11-17 16:42:35

阅读数 282

评论数 0


Given a set of distinct integers, nums, return all possible subsets.Note: Elements in a subset must be in non-descending order. The solution set mu...

2015-11-17 16:40:10

阅读数 243

评论数 0

Two Sum

Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two n...

2015-11-17 16:38:56

阅读数 233

评论数 0

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 “adjac...

2015-11-17 16:37:04

阅读数 292

评论数 0


计算机经典书籍Java 书籍 Core Java 入门书 Effective Java Java Concurrency in practice Java Performance Thinking in Java 深入理解JVM虚拟机 Spring揭秘 大型网站技术架构:核心原理与案例分析 She...

2015-11-17 16:25:07

阅读数 520

评论数 0

取消 删除