Leetcode Problem 1029. Two City Scheduling

1029. Two City Scheduling

Leetcode Solutions

Greedy Approach to Minimize Total Cost for City A and B

  1. Calculate the difference between the cost of going to city A and city B for each person.
  2. Sort the array costs based on this difference in ascending order.
  3. Initialize a variable totalCost to 0 to keep track of the total minimum cost.
  4. Iterate over the first n people in the sorted array and add their cost of going to city A to totalCost.
  5. Iterate over the remaining n people in the sorted array and add their cost of going to city B to totalCost.
  6. Return totalCost as the answer.
UML Thumbnail

Brute Force Approach to Find Minimum Cost for City A and B

Ask Question

Programming Language
image/screenshot of info(optional)
Full Screen
Loading...

Suggested Answer

Answer
Full Screen
Copy Answer Code
Loading...