reach-end-of-array-with-max-score

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an integer array <code>nums</code> of length <code>n</code>.

Your goal is to start at index <code>0</code> and reach index <code>n - 1</code>. You can only jump to indices greater than your current index.

The score for a jump from index <code>i</code> to index <code>j</code> is calculated as <code>(j - i) * nums[i]</code>.

Return the maximum possible total score by the time you reach the last index.

&nbsp;
Example 1:

<div class="example-block">
Input: nums = [1,3,1,5]

Output: 7

Explanation:

First, jump to index 1 and then jump to the last index. The final score is <code>1 * 1 + 2 * 3 = 7</code>.
</div>

Example 2:

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

Output: 16

Explanation:

Jump directly to the last index. The final score is <code>4 * 4 = 16</code>.
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 105</code></li>
</ul>

findMaximumScore

Reach End of Array With Max Score

Greedy

Array

给你一个长度为 <code>n</code>&nbsp;的整数数组&nbsp;<code>nums</code>&nbsp;。

你的目标是从下标 <code>0</code>&nbsp;出发，到达下标 <code>n - 1</code>&nbsp;处。每次你只能移动到&nbsp;更大&nbsp;的下标处。

从下标 <code>i</code>&nbsp;跳到下标 <code>j</code>&nbsp;的得分为&nbsp;<code>(j - i) * nums[i]</code>&nbsp;。

请你返回你到达最后一个下标处能得到的 最大总得分&nbsp;。

&nbsp;

示例 1：

<div class="example-block">
输入：nums = [1,3,1,5]

输出：7

解释：

一开始跳到下标 1 处，然后跳到最后一个下标处。总得分为&nbsp;<code>1 * 1 + 2 * 3 = 7</code>&nbsp;。
</div>

示例 2：

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

输出：16

解释：

直接跳到最后一个下标处。总得分为&nbsp;<code>4 * 4 = 16</code>&nbsp;。
</div>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 105</code></li>
</ul>