码迷,mamicode.com
首页 >  
搜索关键字:divide two integers    ( 17573个结果
Leetcode::JumpGame
Description:Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents...
分类:其他好文   时间:2014-06-09 00:15:33    阅读次数:193
[leetcode]Search for a Range @ Python
原题地址:https://oj.leetcode.com/problems/search-for-a-range/题意:Given a sorted array of integers, find the starting and ending position of a given target ...
分类:编程语言   时间:2014-06-08 21:03:21    阅读次数:297
[leetcode]Add Binary @ Python
原题地址:https://oj.leetcode.com/problems/add-binary/题意:Given two binary strings, return their sum (also a binary string).For example,a ="11"b ="1"Return"...
分类:编程语言   时间:2014-06-08 20:28:04    阅读次数:300
Subsets II
题目 Given a collection of integers that might contain duplicates, S, return all possible subsets. Note: Elements in a subset must be in non-descending order.The solution set must not c...
分类:其他好文   时间:2014-06-08 05:32:21    阅读次数:196
Merge Sorted Array
题目 Given two sorted integer arrays A and B, merge B into A as one sorted array. Note: You may assume that A has enough space (size that is greater or equal to m + n) to hold additional el...
分类:其他好文   时间:2014-06-08 05:05:47    阅读次数:268
Subsets
题目 Given a set of distinct integers, S, return all possible subsets. Note: Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets. ...
分类:其他好文   时间:2014-06-08 04:01:05    阅读次数:240
[LeetCode] Median of Two Sorted Arrays [16]
求两个排序数组的中位数。这个题可以有以下几个思路: 首先可以想到的是将两个数组merge起来,然后返回其中位数。 第二个是,类似merge的思想加上计数,找到(m+n)/2个数或者其前后的数,这个就可以算出中位数。这个方法对于各种情况需要一一考虑到。 第三个,假设A[k/2-1]<B[k/2-1],那么A[k/2-1]之前的数一定在整个有序数列中(m+n)/2之前。 这里我给出后面两种思路的代码。 代码一( 思路三)...
分类:其他好文   时间:2014-06-08 03:44:47    阅读次数:231
HDU 1247 Hat’s Words
Problem Description A hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary. You are to find all the hat’s words in a dictionary.   In...
分类:其他好文   时间:2014-06-08 03:02:14    阅读次数:323
[LeetCode] Two Sum [17]
题目 :Input: numbers={2, 7, 11, 15}, target=9 Output: index1=1, index2=2 解题思路: 给出一个数组合一个数,如果两个数的和等于所给的数,求出该两个数所在数组中的位置。 这个题也挺常见的,就是两个指针,从前后两个方向扫描。但是本题有以下几个需要的点: 1. 所给数组不是有序的; 2. 返回的下标是从1开始的,并且是原来无序数组中的下标; 3. 输入数组中可能含有重复的元素。 好了,把以上三点想到的话,做这个题应该不会有啥问题。 具体方法:把原...
分类:其他好文   时间:2014-06-08 02:14:06    阅读次数:250
LeetCode——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 numbers such that they add up to the target, whe...
分类:其他好文   时间:2014-06-08 02:12:04    阅读次数:216
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!