算法两道题

算法一

Write a function:

int solution(vector<int>&A);

that, given an array A of length N, returns as an integer the minimum number of moves needed to transform a zero-filled array into A.

Examples:

  1. Given A = 2, 1, 3, the function should return 4. For example, the following sequence of moves leads to the solution: 0, 0, 0 → 1, 1, 1 → 2, 1, 1→ 2, 1, 2 → 2, 1, 3.

  2. Given A = 2, 2, 0, 0, 1, the function should return 3. The following sequence of moves leads to the solution: 0, 0, 0, 0, 0 → 1, 1, 0, 0, 0 → 2, 2, 0, 0, 0 → 2, 2, 0, 0, 1.

  3. Given A = 5, 4, 2, 4, 1, the function should return 7. One possible optimal sequence of moves is: 0, 0, 0, 0, 0 → 1, 1, 1, 1, 1 → 2, 2, 2, 2, 1 → 3, 3, 2, 2, 1 → 4, 4, 2, 2, 1 → 5, 4, 2, 2, 1 → 5, 4, 2, 3, 1 → 5, 4, 2, 4, 1.

Write an efficient algorithm for the following assumptions:

N is an integer within the range 1..100,000; each element of array A is an integer within therange 0..1,000,000,000:

we guarantee that the answer will not exceed1,000,000,000.

上面这道题大概就是将一个全0数组变成到目标数组需要多少步骤。每次只能对连续的数字进行增加1的操作。

python 复制代码
# vector<int>& A
def solution(A) {
    int n = len(A);
    
    if (n == 0) return 0;
    
    # Variable to store the total number of moves required
    int moves = A[0];  # We need at least A[0] moves to reach the first element's value
    
    for (int i = 1; i < n; ++i) {
        # If current element is greater than the previous one, 
        # we need extra moves to reach it
        if (A[i] > A[i - 1]) {
            moves += (A[i] - A[i - 1]);
        }
    }
    
    return moves;
}

算法二

There is an array, named `digits`, consisting of N digits. Choose at most three digits (not necessarily adjacent) and merge them into a new integer without changing the order of the digits. What is the biggest number that can be obtained this way?

Write a function:

def solution(digits)

that, given an array of N digits, returns the biggest number that can be built.

Examples:

  1. Given digits = 7, 2, 3, 3, 4, 9, the function

should return 749.

  1. Given digits = 0, 0, 5, 7, the function should

return 57.

Assume that:

N is an integer within the range 3..50;

each element of array, named `digits`, is an

integer within the range 0..9.

In your solution, focus on correctness. The

performance of your solution will not be the focus of

the assessment.

算法是要从一个数组里面选出三个数用来组成一个新的三位数,这三个数字的相对位置不能改变,求能够组成的最大的数字。

算法思路就是先从0~n-2之前挑出最大的数字,然后从上一个数字的索引往后直到n-1之前挑出第二个最大的数字,再从上一个数字的索引到n挑出第三大的数字即可。

相关推荐
Resean022315 分钟前
Spring 源码分析(七)AOP 原理(上):代理的创建
java·后端·spring
Tangq一定可以的26 分钟前
Spring AI Advisor 详解 - 给大模型调用加上“切面“,日志/过滤/记忆一键搞定
java·后端·spring
feixing_fx44 分钟前
JavaScript 是什么:从浏览器脚本到通用编程语言
开发语言·前端·javascript·前端框架·ecmascript
小巫编程室1 小时前
我造了一个 Java 能力包:让 AI 直接调用你的业务代码
java·前端·后端
深入云栈2 小时前
Netty 4.2.x 源码深度解析 (二十四):池化内存分配 —— PoolArena、PoolChunk 与 PoolSubpage
java·后端·架构
惜.己3 小时前
Java结合idea简单使用Playwright
java·开发语言·自动化
利威尔xu3 小时前
PostgreSQL 索引失效 4 类:函数运算让查询全表扫描拖垮性能
开发语言·数据库·postgresql·性能优化·索引优化
ShineWinsu3 小时前
对于Qt:QSpacerItem常见属性以及方法的解析
开发语言·c++·qt·面试·系统架构·客户端·qspaceritem
Vex2une3 小时前
JDK 8 下载安装与环境变量配置完整指南(Windows新手图文教程)
java·windows·环境配置·环境变量·jdk8·jdk下载安装·java入门教程
文丑颜不良啊4 小时前
LeetCode3281~3300题目解析
java·leetcode