TCHS-8-250

Problem Statement

     Last night, after that terrible nightmare about pink elephants, you decided that you would never again go to sleep unless the time showing on your digital clock was a multiple of the number of elephants in your dream. Rather than waiting and constantly checking the clock, you decide to calculate the earliest time after the current time that you can go to sleep. Write a method which takes the currentTime on your clock, and the number of elephants in your dream, and returns the earliest future time that is a multiple of elephants.

currentTime will be a int[] containing exactly two elements. The first element is the current hour value on the clock (between 0 and 23, inclusive), and the second element is the current minute (between 0 and 59, inclusive). The returned int[] must also follow this format.

The time on the clock is a multiple of some number k whenever the digits on the clock form a four-digit number ('HHMM') which is divisible by k - for example 10:01 is divisible by 11 (1001 = 11 * 91), but 01:04 is not divisible by 7 (104 = 14 * 7 + 6). Even if you can fall asleep at the current time, you must return the next time you can fall asleep.

Definition

    
Class: FussySleeper
Method: nextTime
Parameters: int[], int
Returns: int[]
Method signature: int[] nextTime(int[] currentTime, int elephants)
(be sure your method is public)
    
 

Constraints

- currentTime will be as described in the statement.
- elephants will be between 1 and 1000, inclusive.

Examples

0)  
    
{21, 30}
 
100
 
Returns: {22, 0 }
 
You are able to sleep at the top of every hour. The earliest future time that satisfies this requirement is 22:00 (2200 = 22 x 100).
1)  
    
{20, 30}
 
23
 
Returns: {20, 47 }
 
You just missed your chance to sleep at 20:24 (2024 = 23 x 88) but your next chance is at 20:47
2)  
    
{23,55}
 
1
 
Returns: {23, 56 }
 
With only one elephant, you can sleep every minute, so the next possible time is 23:56
3)  
    
{0, 0}
 
999
 
Returns: {0, 0 }
 
With so many elephants in your dream, the only time you can sleep is at midnight. Although you can't sleep currently, you will be able to the next time the clock hits "00:00".
public class FussySleeper {

	public int[] nextTime(int[] curr, int k) {
		while (true) {
			curr[1]++;
			if (curr[1] == 60) {
				curr[1] = 0;
				curr[0]++;
			}
			if (curr[0] == 24)
				curr[0] = 0;
			if ((curr[0] * 100 + curr[1]) % k == 0)
				return curr;
		}
	}

}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
毕业设计,基于SpringBoot+Vue+MySQL开发的公寓报修管理系统,源码+数据库+毕业论文+视频演示 现代经济快节奏发展以及不断完善升级的信息化技术,让传统数据信息的管理升级为软件存储,归纳,集中处理数据信息的管理方式。本公寓报修管理系统就是在这样的大环境下诞生,其可以帮助管理者在短时间内处理完毕庞大的数据信息,使用这种软件工具可以帮助管理人员提高事务处理效率,达到事半功倍的效果。此公寓报修管理系统利用当下成熟完善的Spring Boot框架,使用跨平台的可开发大型商业网站的Java语言,以及最受欢迎的RDBMS应用软件之一的MySQL数据库进行程序开发。公寓报修管理系统有管理员,住户,维修人员。管理员可以管理住户信息和维修人员信息,可以审核维修人员的请假信息,住户可以申请维修,可以对维修结果评价,维修人员负责住户提交的维修信息,也可以请假。公寓报修管理系统的开发根据操作人员需要设计的界面简洁美观,在功能模块布局上跟同类型网站保持一致,程序在实现基本要求功能时,也为数据信息面临的安全问题提供了一些实用的解决方案。可以说该程序在帮助管理者高效率地处理工作事务的同时,也实现了数据信息的整体化,规范化与自动化。 关键词:公寓报修管理系统;Spring Boot框架;MySQL;自动化;VUE
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值