码迷,mamicode.com
首页 >  
搜索关键字:suppose    ( 588个结果
【Leetcode】605. Can Place Flowers
Description Suppose you have a long flowerbed in which some of the plots are planted and some are not. However, flowers cannot be planted in adjacent ...
分类:其他好文   时间:2018-07-30 13:32:10    阅读次数:161
【POJ1195】Mobile phones
Mobile phones Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 21905 Accepted: 10188 Description Suppose that the fourth generation mobile p ...
分类:其他好文   时间:2018-07-29 16:25:59    阅读次数:138
PAT 1017 Queueing at Bank[一般]
Suppose a bank has K windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. All the c ...
分类:其他好文   时间:2018-07-29 14:20:36    阅读次数:119
POJ 1860 Currency Exchange(如何Bellman-Ford算法判断正环)
题目链接: https://cn.vjudge.net/problem/POJ-1860 Several currency exchange points are working in our city. Let us suppose that each point specializes in t ...
分类:编程语言   时间:2018-07-28 19:38:35    阅读次数:175
PAT 1017 Queueing at Bank
Suppose a bank has K windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. All the c ...
分类:其他好文   时间:2018-07-28 15:23:50    阅读次数:115
HDU 2069 Coin Change
http://acm.hdu.edu.cn/showproblem.php?pid=2069 Problem Description Suppose there are 5 types of coins: 50-cent, 25-cent, 10-cent, 5-cent, and 1-cent. ...
分类:其他好文   时间:2018-07-28 00:17:54    阅读次数:193
LeetCode 406.Queue Reconstruction by Height
我们先来看题目描述: Suppose you have a random list of people standing in a queue. Each person is described by a pair of integers (h, k), where h is the height ...
分类:其他好文   时间:2018-07-24 20:52:06    阅读次数:148
(Java) LeetCode 433. Minimum Genetic Mutation —— 最小基因变化
A gene string can be represented by an 8-character long string, with choices from "A", "C", "G", "T". Suppose we need to investigate about a mutation ...
分类:编程语言   时间:2018-07-13 10:20:45    阅读次数:522
1119 Pre- and Post-order Traversals(30 分)
Suppose that all the keys in a binary tree are distinct positive integers. A unique binary tree can be determined by a given pair of postorder and ino ...
分类:其他好文   时间:2018-07-06 12:15:29    阅读次数:181
PAT 1086 Tree Traversals Again (25)
An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the ...
分类:其他好文   时间:2018-06-26 23:46:02    阅读次数:225
588条   上一页 1 ... 11 12 13 14 15 ... 59 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!