1 Star 0 Fork 332

大宇 / leetcode

forked from doocs / leetcode 
加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
克隆/下载
README_EN.md 1.72 KB
一键复制 编辑 原始数据 按行查看 历史
ylb 提交于 2021-04-22 11:34 . feat: use relative path

818. Race Car

中文文档

Description

Your car starts at position 0 and speed +1 on an infinite number line.  (Your car can go into negative positions.)

Your car drives automatically according to a sequence of instructions A (accelerate) and R (reverse).

When you get an instruction "A", your car does the following: position += speed, speed *= 2.

When you get an instruction "R", your car does the following: if your speed is positive then speed = -1 , otherwise speed = 1.  (Your position stays the same.)

For example, after commands "AAR", your car goes to positions 0->1->3->3, and your speed goes to 1->2->4->-1.

Now for some target position, say the length of the shortest sequence of instructions to get there.


Example 1:

Input: 

target = 3

Output: 2

Explanation: 

The shortest instruction sequence is "AA".

Your position goes from 0->1->3.


Example 2:

Input: 

target = 6

Output: 5

Explanation: 

The shortest instruction sequence is "AAARA".

Your position goes from 0->1->3->7->7->6.

 

Note:

  • 1 <= target <= 10000.

Solutions

Python3

Java

...

马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
Java
1
https://gitee.com/fdayu/leetcode.git
git@gitee.com:fdayu/leetcode.git
fdayu
leetcode
leetcode
main

搜索帮助

344bd9b3 5694891 D2dac590 5694891