HackerRank: Jumping on the Clouds

题目链接：https://www.hackerrank.com/challenges/jumping-on-the-clouds/problem?h_l=interview&playlist_slugs%5B%5D=interview-preparation-kit&playlist_slugs%5B%5D=warmup

tips:需要注意java.lang.ArrayIndexOutOfBoundsException

（1）首尾都是0

（2）如果下一个的下一个还是0，那就跳过下一个直接到下下个云。但是最大也只能隔一个跳。（表达不太好~~）

（3）我们要的结果是最短从首到尾的步数。

import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;public class Solution {// Complete the jumpingOnClouds function below.static int jumpingOnClouds(int[] c) {int jumpSteps = 0;for (int i = 1; i < c.length; i++) {jumpSteps ++;if (i >= c.length - 1) break;if (c[i+1] == 0)i ++;}return jumpSteps;}private static final Scanner scanner = new Scanner(System.in);public static void main(String[] args) throws IOException {BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));int n = scanner.nextInt();scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");int[] c = new int[n];String[] cItems = scanner.nextLine().split(" ");scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");for (int i = 0; i < n; i++) {int cItem = Integer.parseInt(cItems[i]);c[i] = cItem;}int result = jumpingOnClouds(c);bufferedWriter.write(String.valueOf(result));bufferedWriter.newLine();bufferedWriter.close();scanner.close();}
}

HackerRank: Jumping on the Clouds相关推荐

Paper5：Curved-Voxel Clustering for Accurate Segmentation of 3D LiDAR Point Clouds with Real-Time Per
给定一个3D激光雷达点云,我们如何快速且精确地分割它们?快速且精确的3D激光雷达点云分割是移动机器人在分类,跟踪,SLAM等不同应用中的重要问题.尽管它很重要,但是现有方法无法同时实现速度和准确性:尤 ...
CF510D Fox And Jumping（动态规划转换为最短路，O(n^2×2^9) -＞ O(nlogn)，裴蜀定理应用）
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划以下内容摘自我的文章:算法竞赛中的数论问题 - 数论全家桶(信奥 / 数竞 / ACM)作者孟繁宇, ...
Deep Learning for 3D Point Clouds: A Survey 论文阅读
点击上方"3D视觉工坊",选择"星标" 干货第一时间送达 Abstract:在点云深度学习中,主要包含的任务有:3D形状分类.3D目标检测和跟踪.3D点云分割. ...
HackerRank：JavaScript 是最知名的编程语言
开发四年只会写业务代码,分布式高并发都不会还做程序员? HackerRank 于昨日发布了 2019 年版的年度<开发者技能报告>,报告调查了来自 100 多个国家的 71000 余名 ...
HDU_1087-Super Jumping! Jumping! Jumping!
Super Jumping! Jumping! Jumping! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K ...
hackerrank杂记
https://www.hackerrank.com/challenges/py-set-discard-remove-pop/forum 知识点: *list:将list中的值取出,取出的数据大小是 ...
HackerRank Gift Boxes(hash)
在当前计算的长度不小于g字符串长度时,需要比较c串对应长度的哈希值与g的哈希值,如果相同,则需要更新当前的计算哈希的下标. 代码参考: OJ/hackerrank/Gift Boxes at mast ...
HDU OJ Super Jumping! Jumping! Jumping!
Super Jumping! Jumping! Jumping! Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K ...
《FreeFlow: Software-based Virtual RDMA Networking for Containerized Clouds》
FreeFlow: Software-based Virtual RDMA Networking for Containerized Clouds Abstract 1 Introduction 背景 ...

HackerRank: Jumping on the Clouds

HackerRank: Jumping on the Clouds相关推荐

最新文章

热门文章