码迷,mamicode.com
首页 >  
搜索关键字:note    ( 7358个结果
Leetcode- Single Number II
Given an array of integers, every element appears three times except for one. Find that single one.Note: We generalize this problem to:Given an array ...
分类:其他好文   时间:2014-12-23 07:57:05    阅读次数:180
leetcode. 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...
分类:其他好文   时间:2014-12-22 19:18:27    阅读次数:180
live archive 3971
/** ?*?@brief?live?archive?3971 ?*?@file?3971.cpp ?*?@author?mianma ?*?@created?2014/12/22?16:23 ?*?@edited??2014/12/22?16:23 ?*?@type?binart_search ?*?@note ?*?@cost?t...
分类:其他好文   时间:2014-12-22 18:10:47    阅读次数:154
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 ord...
分类:其他好文   时间:2014-12-22 17:56:21    阅读次数:141
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 no...
分类:其他好文   时间:2014-12-22 17:55:10    阅读次数:220
leetcode------Merge Sorted Array
标题:Merge Sorted Array通过率:31.1%难度:简单Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough s...
分类:其他好文   时间:2014-12-21 23:22:34    阅读次数:249
问题:No more handles [Could not detect registered XULRunner to use]
下载一个xurlrunner https://developer.mozilla.org/en/XULRunner_1.9.2_Release_Note解压 然后在你的 myeclipse.ini (myeclipse安装目录下有这个文件)最后面加上-Dorg.eclipse.swt.brow...
分类:其他好文   时间:2014-12-21 22:07:05    阅读次数:235
【leetcode】Merge Sorted Array
Merge Sorted ArrayGiven 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 i...
分类:其他好文   时间:2014-12-21 22:02:28    阅读次数:189
Python中的推导式介绍
推导式是Python中很强大的、很受欢迎的特性,具有语言简洁,速度快等优点。推导式包括: 列表推导式 字典推导式 集合推导式 嵌套列表推导式 NOTE: 字典和集合推导是最近才加入到Python的(Python 2.7 和Python 3.1以上版)....
分类:编程语言   时间:2014-12-20 19:41:14    阅读次数:247
[LeetCode]Best Time to Buy and Sell Stock III
Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete at most two transactions. Note: You may ...
分类:其他好文   时间:2014-12-20 18:20:25    阅读次数:128
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!