maximize-the-profit-as-the-salesman

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

You are given an integer <code>n</code> representing the number of houses on a number line, numbered from <code>0</code> to <code>n - 1</code>.

Additionally, you are given a 2D integer array <code>offers</code> where <code>offers[i] = [starti, endi, goldi]</code>, indicating that <code>ith</code> buyer wants to buy all the houses from <code>starti</code> to <code>endi</code> for <code>goldi</code> amount of gold.

As a salesman, your goal is to maximize your earnings by strategically selecting and selling houses to buyers.

Return the maximum amount of gold you can earn.

Note that different buyers can&#39;t buy the same house, and some houses may remain unsold.

&nbsp;
Example 1:

<pre>
Input: n = 5, offers = [[0,0,1],[0,2,2],[1,3,2]]
Output: 3
Explanation: There are 5 houses numbered from 0 to 4 and there are 3 purchase offers.
We sell houses in the range [0,0] to 1st buyer for 1 gold and houses in the range [1,3] to 3rd buyer for 2 golds.
It can be proven that 3 is the maximum amount of gold we can achieve.
</pre>

Example 2:

<pre>
Input: n = 5, offers = [[0,0,1],[0,2,10],[1,3,2]]
Output: 10
Explanation: There are 5 houses numbered from 0 to 4 and there are 3 purchase offers.
We sell houses in the range [0,2] to 2nd buyer for 10 golds.
It can be proven that 10 is the maximum amount of gold we can achieve.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= n &lt;= 105</code></li>
	<li><code>1 &lt;= offers.length &lt;= 105</code></li>
	<li><code>offers[i].length == 3</code></li>
	<li><code>0 &lt;= starti &lt;= endi &lt;= n - 1</code></li>
	<li><code>1 &lt;= goldi &lt;= 103</code></li>
</ul>

maximizeTheProfit

Maximize the Profit as the Salesman

Array

Hash Table

Binary Search

Dynamic Programming

Sorting

给你一个整数 <code>n</code> 表示数轴上的房屋数量，编号从 <code>0</code> 到 <code>n - 1</code> 。

另给你一个二维整数数组 <code>offers</code> ，其中 <code>offers[i] = [starti, endi, goldi]</code> 表示第 <code>i</code> 个买家想要以 <code>goldi</code> 枚金币的价格购买从 <code>starti</code> 到 <code>endi</code> 的所有房屋。

作为一名销售，你需要有策略地选择并销售房屋使自己的收入最大化。

返回你可以赚取的金币的最大数目。

注意 同一所房屋不能卖给不同的买家，并且允许保留一些房屋不进行出售。

&nbsp;

示例 1：

<pre>
输入：n = 5, offers = [[0,0,1],[0,2,2],[1,3,2]]
输出：3
解释：
有 5 所房屋，编号从 0 到 4 ，共有 3 个购买要约。
将位于 [0,0] 范围内的房屋以 1 金币的价格出售给第 1 位买家，并将位于 [1,3] 范围内的房屋以 2 金币的价格出售给第 3 位买家。
可以证明我们最多只能获得 3 枚金币。</pre>

示例 2：

<pre>
输入：n = 5, offers = [[0,0,1],[0,2,10],[1,3,2]]
输出：10
解释：有 5 所房屋，编号从 0 到 4 ，共有 3 个购买要约。
将位于 [0,2] 范围内的房屋以 10 金币的价格出售给第 2 位买家。
可以证明我们最多只能获得 10 枚金币。</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= n &lt;= 105</code></li>
	<li><code>1 &lt;= offers.length &lt;= 105</code></li>
	<li><code>offers[i].length == 3</code></li>
	<li><code>0 &lt;= starti &lt;= endi &lt;= n - 1</code></li>
	<li><code>1 &lt;= goldi &lt;= 103</code></li>
</ul>