elevator-requests-i

java

python3

python

javascript

typescript

csharp

golang

kotlin

swift

rust

ruby

dart

scala

elixir

erlang

racket

cangjie

bash

mysql

mssql

postgresql

oraclesql

pythondata

Algorithms

You are given an integer <code>n</code> denoting the number of floors in a building, where the floors are numbered from 0 to <code>n - 1</code>.

You are also given an integer array <code>requests</code>, where <code>requests</code> represents the sequence of floor requests.

An elevator starts at floor 0 and follows these rules:

<ul>
	<li>The elevator moves one floor per second.</li>
	<li>The elevator serves requests in the given order.</li>
	<li>If the elevator is already on the requested floor, no movement is needed.</li>
	<li>After serving a request, the elevator immediately starts moving toward the next request.</li>
</ul>

Return the total time in seconds required to serve all requests.

&nbsp;
Example 1:

<div class="example-block">
Input: n = 5, requests = [2,1,4,3]

Output: 7

Explanation:

<ul>
	<li><code>requests[0] = 2</code>: Moving from floor 0 to floor 2 takes 2 seconds.</li>
	<li><code>requests[1] = 1</code>: Moving from floor 2 to floor 1 takes 1 second.</li>
	<li><code>requests[2] = 4</code>: Moving from floor 1 to floor 4 takes 3 seconds.</li>
	<li><code>requests[3] = 3</code>: Moving from floor 4 to floor 3 takes 1 second.</li>
</ul>

The total time required is <code>2 + 1 + 3 + 1 = 7</code> seconds.
</div>

Example 2:

<div class="example-block">
Input: n = 3, requests = [2,0,0]

Output: 4

Explanation:

<ul>
	<li><code>requests[0] = 2</code>: Moving from floor 0 to floor 2 takes 2 seconds.</li>
	<li><code>requests[1] = 0</code>: Moving from floor 2 to floor 0 takes 2 seconds.</li>
	<li><code>requests[2] = 0</code>: No movement is needed.</li>
</ul>

The total time required is <code>2 + 2 + 0 = 4</code> seconds.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 100</code></li>
	<li><code>1 &lt;= requests.length &lt;= 100</code></li>
	<li><code>0 &lt;= requests[i] &lt;= n - 1</code></li>
</ul>

第 189 场双周赛

biweekly-contest-189

elevatorRequests

中级工程师

Elevator Requests I

给你一个整数 <code>n</code> ，表示一栋楼房的楼层数，楼层编号从 0 到 <code>n - 1</code> 。

同时给你一个整数数组 <code>requests</code> ，其中 <code>requests</code> 表示楼层请求的序列。

一部电梯初始在 0 层，遵循以下规则：

<ul>
	<li>电梯每秒移动一层。</li>
	<li>电梯按给定的顺序处理请求。</li>
	<li>如果电梯已经在请求的楼层，则不需要移动。</li>
	<li>处理完一个请求后，电梯立即开始向下一个请求的楼层移动。</li>
</ul>

返回处理所有请求所需的 总时间 （以秒为单位）。

&nbsp;

示例 1：

<div class="example-block">
输入： n = 5, requests = [2,1,4,3]

输出： 7

解释：

<ul>
	<li><code>requests[0] = 2</code>：从 0 层移动到 2 层需要 2 秒。</li>
	<li><code>requests[1] = 1</code>：从 2 层移动到 1 层需要 1 秒。</li>
	<li><code>requests[2] = 4</code>：从 1 层移动到 4 层需要 3 秒。</li>
	<li><code>requests[3] = 3</code>：从 4 层移动到 3 层需要 1 秒。</li>
</ul>

所需的总时间是 <code>2 + 1 + 3 + 1 = 7</code> 秒。
</div>

示例 2：

<div class="example-block">
输入： n = 3, requests = [2,0,0]

输出： 4

解释：

<ul>
	<li><code>requests[0] = 2</code>：从 0 层移动到 2 层需要 2 秒。</li>
	<li><code>requests[1] = 0</code>：从 2 层移动到 0 层需要 2 秒。</li>
	<li><code>requests[2] = 0</code>：不需要移动。</li>
</ul>

所需的总时间是 <code>2 + 2 + 0 = 4</code> 秒。
</div>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= n &lt;= 100</code></li>
	<li><code>1 &lt;= requests.length &lt;= 100</code></li>
	<li><code>0 &lt;= requests[i] &lt;= n - 1</code></li>
</ul>