CPMagical CP Library

Problem solution · Java

Maximum Weighted K-Edge Path

Maximum Weighted K-Edge Path: a Java solution using dynamic programming. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Dynamic programming
Source
walkccc LeetCode Solutions
Length
48 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Dynamic programming

For Maximum Weighted K-Edge Path, the implementation records answers for smaller states and reuses them to build the requested result without repeating work.

  1. Define precisely what one DP state represents.
  2. Establish the base cases before transitions are evaluated.
  3. Process states in dependency order and combine only already-known values.

Code notes

  • 48 lines of Java from the credited upstream file 3543.java.
  • The implementation visibly relies on sequence storage, hash lookup, ordered lookup, cached states.
  • 9 loop blocks detected.

Complexity

Multiply the number of reachable states by the work performed for each transition, then include the stored state table in memory usage.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeMaximum Weighted K-Edge Path · JavaJava
Use this to learn the idea, then write your own version.
class Solution {  public int maxWeight(int n, int[][] edges, int k, int t) {    List<Pair<Integer, Integer>>[] graph = new List[n];    // dp[i][j] := the set of possible path sums ending at node i with j edges    Map<Integer, Set<Integer>>[] dp = new Map[n];     for (int u = 0; u < n; ++u) {      graph[u] = new ArrayList<>();      dp[u] = new HashMap<>();    }     for (int[] edge : edges) {      final int u = edge[0];      final int v = edge[1];      final int w = edge[2];      graph[u].add(new Pair<>(v, w));    }     for (int u = 0; u < n; ++u) {      dp[u].putIfAbsent(0, new HashSet<>());      dp[u].get(0).add(0); // zero edges = sum 0    }     for (int i = 0; i < k; ++i)      for (int u = 0; u < n; ++u)        if (dp[u].containsKey(i))          for (final int currSum : dp[u].get(i))            for (Pair<Integer, Integer> pair : graph[u]) {              final int v = pair.getKey();              final int w = pair.getValue();              final int newSum = currSum + w;              if (newSum < t) {                dp[v].putIfAbsent(i + 1, new HashSet<>());                dp[v].get(i + 1).add(newSum);              }            }     int ans = -1;     for (int u = 0; u < n; ++u)      if (dp[u].containsKey(k))        for (final int sum : dp[u].get(k))          ans = Math.max(ans, sum);     return ans;  }}

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗