码迷,mamicode.com
首页 >  
搜索关键字:medium    ( 2358个结果
Sicily 1035 DNA matching
Time Limit: 1 secs, Memory Limit: 32 MB DNA (Deoxyribonucleic acid) is founded in every living creature as the storage medium for genetic information.
分类:其他好文   时间:2016-03-23 06:13:56    阅读次数:183
lintcode-medium-Integer to Roman
Given an integer, convert it to a roman numeral. The number is guaranteed to be within the range from 1 to 3999. 4 -> IV 12 -> XII 21 -> XXI 99 -> XCI
分类:其他好文   时间:2016-03-22 19:09:15    阅读次数:169
样式重置 取消input默认样式
body, h1, h2, h3, h4, h5, h6, hr, p,blockquote, dl, dt, dd, ul, ol, li,pre, form, fieldset, legend, button, input, textarea, th, td, img{border:medium
分类:其他好文   时间:2016-03-22 17:29:39    阅读次数:184
lintcode-medium-Heapify
Given an integer array, heapify it into a min-heap array. Given [3,2,1,4,5], return [1,2,3,4,5] or any legal heap array.
分类:Windows程序   时间:2016-03-22 13:48:10    阅读次数:247
lintcode-medium-Gas Station
There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it cost
分类:其他好文   时间:2016-03-21 09:25:21    阅读次数:154
lintcode-medium-Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Given n = 3, a solution set is: "((()))", "(()
分类:其他好文   时间:2016-03-21 09:22:49    阅读次数:188
lintcode-medium-Find Peak Element
There is an integer array which has the following features: We define a position P is a peek if: Find a peak element in this array. Return the index o
分类:其他好文   时间:2016-03-21 08:12:37    阅读次数:134
lintcode-medium-First Bad Version
The code base version is an integer start from 1 to n. One day, someone committed a bad version in the code case, so it caused this version and the fo
分类:其他好文   时间:2016-03-21 08:12:22    阅读次数:138
lintcode-medium-Find the Missing Number
Given an array contains N numbers of 0 .. N, find which number doesn't exist in the array. Given N = 3 and the array [0, 1, 3], return 2.
分类:其他好文   时间:2016-03-21 08:11:01    阅读次数:231
lintcode-medium-Find Minimum in Rotated Sorted Array II
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 element.
分类:其他好文   时间:2016-03-20 16:10:02    阅读次数:175
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!