【2023】华为OD机试真题Java-题目0219-查找充电设备组合

 非常典型的动态规划问题

package com.company.test;

import java.util.Arrays;

public class Main1 {
    public static void main(String[] args) {
        int[] vetex = new int[]{50,20,20,60};
        int n = 90;
        Graph graph = new Graph(vetex,n);
        System.out.println(graph.getMaxPower());
    }
    static class Graph{
        int[] vetex;
        int vertexs;
        int power;
        int[][] edges;
        public Graph(int[] vetex, int pow) {
            this.vetex = vetex;
            this.vertexs = vetex.length;
            this.power = pow;
            this.edges = new int[vertexs+1][power+1];
        }

        public int getMaxPower(){
            for (int i = 1; i < vetex.length+1; i++) {
                for (int j = 1; j < power+1; j++) {
                    if(vetex[i-1] > j){
                        edges[i][j] = edges[i-1][j];
                    }else{
                        int i1 = edges[i-1][j];
                        int i2 = vetex[i-1] + edges[i-1][j-vetex[i-1]];
                        int max = Math.max(i1,i2);
                        edges[i][j] = max;
                    }
                }
            }
            for (int i = 0; i < vetex.length; i++) {
                System.out.println(Arrays.toString(edges[i]));
            }
            return edges[vertexs][power];
        }
    }
}