mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
168 lines
17 KiB
JSON
168 lines
17 KiB
JSON
|
{
|
|||
|
|
"data": {
|
|||
|
|
"question": {
|
|||
|
|
"questionId": "1382",
|
|||
|
|
"questionFrontendId": "2303",
|
|||
|
|
"boundTopicId": null,
|
|||
|
|
"title": "Calculate Amount Paid in Taxes",
|
|||
|
|
"titleSlug": "calculate-amount-paid-in-taxes",
|
|||
|
|
"content": "<p>You are given a <strong>0-indexed</strong> 2D integer array <code>brackets</code> where <code>brackets[i] = [upper<sub>i</sub>, percent<sub>i</sub>]</code> means that the <code>i<sup>th</sup></code> tax bracket has an upper bound of <code>upper<sub>i</sub></code> and is taxed at a rate of <code>percent<sub>i</sub></code>. The brackets are <strong>sorted</strong> by upper bound (i.e. <code>upper<sub>i-1</sub> < upper<sub>i</sub></code> for <code>0 < i < brackets.length</code>).</p>\n\n<p>Tax is calculated as follows:</p>\n\n<ul>\n\t<li>The first <code>upper<sub>0</sub></code> dollars earned are taxed at a rate of <code>percent<sub>0</sub></code>.</li>\n\t<li>The next <code>upper<sub>1</sub> - upper<sub>0</sub></code> dollars earned are taxed at a rate of <code>percent<sub>1</sub></code>.</li>\n\t<li>The next <code>upper<sub>2</sub> - upper<sub>1</sub></code> dollars earned are taxed at a rate of <code>percent<sub>2</sub></code>.</li>\n\t<li>And so on.</li>\n</ul>\n\n<p>You are given an integer <code>income</code> representing the amount of money you earned. Return <em>the amount of money that you have to pay in taxes.</em> Answers within <code>10<sup>-5</sup></code> of the actual answer will be accepted.</p>\n\n<p> </p>\n<p><strong>Example 1:</strong></p>\n\n<pre>\n<strong>Input:</strong> brackets = [[3,50],[7,10],[12,25]], income = 10\n<strong>Output:</strong> 2.65000\n<strong>Explanation:</strong>\nBased on your income, you have 3 dollars in the 1<sup>st</sup> tax bracket, 4 dollars in the 2<sup>nd</sup> tax bracket, and 3 dollars in the 3<sup>rd</sup> tax bracket.\nThe tax rate for the three tax brackets is 50%, 10%, and 25%, respectively.\nIn total, you pay $3 * 50% + $4 * 10% + $3 * 25% = $2.65 in taxes.\n</pre>\n\n<p><strong>Example 2:</strong></p>\n\n<pre>\n<strong>Input:</strong> brackets = [[1,0],[4,25],[5,50]], income = 2\n<strong>Output:</strong> 0.25000\n<strong>Explanation:</strong>\nBased on your income, you have 1 dollar in the 1<sup>st</sup> tax bracket and 1 dollar in the 2<sup>nd</sup> tax bracket.\nThe tax rate for the two tax brackets is 0% and 25%, respectively.\nIn total, you pay $1 * 0% + $1 * 25% = $0.25 in taxes.\n</pre>\n\n<p><strong>Example 3:</strong></p>\n\n<pre>\n<strong>Input:</strong> brackets = [[2,50]], income = 0\n<strong>Output:</strong> 0.00000\n<strong>Explanation:</strong>\nYou have no income to tax, so you have to pay a total of $0 in taxes.\n</pre>\n\n<p> </p>\n<p><strong>Constraints:</strong></p>\n\n<ul>\n\t<li><code>1 <= brackets.length <= 100</code></li>\n\t<li><code>1 <= upper<sub>i</sub> <= 1000</code></li>\n\t<li><code>0 <= percent<sub>i</sub> <= 100</code></li>\n\t<li><code>0 <= income <= 1000</code></li>\n\t<li><code>upper<sub>i</sub></code> is sorted in ascending order.</li>\n\t<li>All the values of <code>upper<sub>i</sub></code> are <strong>unique</strong>.</li>\n\t<li>The upper bound of the last tax bracket is greater than or equal to <code>income</code>.</li>\n</ul>\n",
|
|||
|
|
"translatedTitle": null,
|
|||
|
|
"translatedContent": null,
|
|||
|
|
"isPaidOnly": false,
|
|||
|
|
"difficulty": "Easy",
|
|||
|
|
"likes": 86,
|
|||
|
|
"dislikes": 120,
|
|||
|
|
"isLiked": null,
|
|||
|
|
"similarQuestions": "[]",
|
|||
|
|
"exampleTestcases": "[[3,50],[7,10],[12,25]]\n10\n[[1,0],[4,25],[5,50]]\n2\n[[2,50]]\n0",
|
|||
|
|
"categoryTitle": "Algorithms",
|
|||
|
|
"contributors": [],
|
|||
|
|
"topicTags": [
|
|||
|
|
{
|
|||
|
|
"name": "Array",
|
|||
|
|
"slug": "array",
|
|||
|
|
"translatedName": null,
|
|||
|
|
"__typename": "TopicTagNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"name": "Simulation",
|
|||
|
|
"slug": "simulation",
|
|||
|
|
"translatedName": null,
|
|||
|
|
"__typename": "TopicTagNode"
|
|||
|
|
}
|
|||
|
|
],
|
|||
|
|
"companyTagStats": null,
|
|||
|
|
"codeSnippets": [
|
|||
|
|
{
|
|||
|
|
"lang": "C++",
|
|||
|
|
"langSlug": "cpp",
|
|||
|
|
"code": "class Solution {\npublic:\n double calculateTax(vector<vector<int>>& brackets, int income) {\n \n }\n};",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Java",
|
|||
|
|
"langSlug": "java",
|
|||
|
|
"code": "class Solution {\n public double calculateTax(int[][] brackets, int income) {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Python",
|
|||
|
|
"langSlug": "python",
|
|||
|
|
"code": "class Solution(object):\n def calculateTax(self, brackets, income):\n \"\"\"\n :type brackets: List[List[int]]\n :type income: int\n :rtype: float\n \"\"\"\n ",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Python3",
|
|||
|
|
"langSlug": "python3",
|
|||
|
|
"code": "class Solution:\n def calculateTax(self, brackets: List[List[int]], income: int) -> float:\n ",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "C",
|
|||
|
|
"langSlug": "c",
|
|||
|
|
"code": "\n\ndouble calculateTax(int** brackets, int bracketsSize, int* bracketsColSize, int income){\n\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "C#",
|
|||
|
|
"langSlug": "csharp",
|
|||
|
|
"code": "public class Solution {\n public double CalculateTax(int[][] brackets, int income) {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "JavaScript",
|
|||
|
|
"langSlug": "javascript",
|
|||
|
|
"code": "/**\n * @param {number[][]} brackets\n * @param {number} income\n * @return {number}\n */\nvar calculateTax = function(brackets, income) {\n \n};",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Ruby",
|
|||
|
|
"langSlug": "ruby",
|
|||
|
|
"code": "# @param {Integer[][]} brackets\n# @param {Integer} income\n# @return {Float}\ndef calculate_tax(brackets, income)\n \nend",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Swift",
|
|||
|
|
"langSlug": "swift",
|
|||
|
|
"code": "class Solution {\n func calculateTax(_ brackets: [[Int]], _ income: Int) -> Double {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Go",
|
|||
|
|
"langSlug": "golang",
|
|||
|
|
"code": "func calculateTax(brackets [][]int, income int) float64 {\n \n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Scala",
|
|||
|
|
"langSlug": "scala",
|
|||
|
|
"code": "object Solution {\n def calculateTax(brackets: Array[Array[Int]], income: Int): Double = {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Kotlin",
|
|||
|
|
"langSlug": "kotlin",
|
|||
|
|
"code": "class Solution {\n fun calculateTax(brackets: Array<IntArray>, income: Int): Double {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Rust",
|
|||
|
|
"langSlug": "rust",
|
|||
|
|
"code": "impl Solution {\n pub fn calculate_tax(brackets: Vec<Vec<i32>>, income: i32) -> f64 {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "PHP",
|
|||
|
|
"langSlug": "php",
|
|||
|
|
"code": "class Solution {\n\n /**\n * @param Integer[][] $brackets\n * @param Integer $income\n * @return Float\n */\n function calculateTax($brackets, $income) {\n \n }\n}",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "TypeScript",
|
|||
|
|
"langSlug": "typescript",
|
|||
|
|
"code": "function calculateTax(brackets: number[][], income: number): number {\n\n};",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Racket",
|
|||
|
|
"langSlug": "racket",
|
|||
|
|
"code": "(define/contract (calculate-tax brackets income)\n (-> (listof (listof exact-integer?)) exact-integer? flonum?)\n\n )",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Erlang",
|
|||
|
|
"langSlug": "erlang",
|
|||
|
|
"code": "-spec calculate_tax(Brackets :: [[integer()]], Income :: integer()) -> float().\ncalculate_tax(Brackets, Income) ->\n .",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
},
|
|||
|
|
{
|
|||
|
|
"lang": "Elixir",
|
|||
|
|
"langSlug": "elixir",
|
|||
|
|
"code": "defmodule Solution do\n @spec calculate_tax(brackets :: [[integer]], income :: integer) :: float\n def calculate_tax(brackets, income) do\n\n end\nend",
|
|||
|
|
"__typename": "CodeSnippetNode"
|
|||
|
|
}
|
|||
|
|
],
|
|||
|
|
"stats": "{\"totalAccepted\": \"18.2K\", \"totalSubmission\": \"29.5K\", \"totalAcceptedRaw\": 18166, \"totalSubmissionRaw\": 29499, \"acRate\": \"61.6%\"}",
|
|||
|
|
"hints": [
|
|||
|
|
"As you iterate through the tax brackets, keep track of the previous tax bracket’s upper bound in a variable called prev. If there is no previous tax bracket, use 0 instead.",
|
|||
|
|
"The amount of money in the ith tax bracket is min(income, upperi) - prev."
|
|||
|
|
],
|
|||
|
|
"solution": null,
|
|||
|
|
"status": null,
|
|||
|
|
"sampleTestCase": "[[3,50],[7,10],[12,25]]\n10",
|
|||
|
|
"metaData": "{\n \"name\": \"calculateTax\",\n \"params\": [\n {\n \"name\": \"brackets\",\n \"type\": \"integer[][]\"\n },\n {\n \"type\": \"integer\",\n \"name\": \"income\"\n }\n ],\n \"return\": {\n \"type\": \"double\"\n }\n}",
|
|||
|
|
"judgerAvailable": true,
|
|||
|
|
"judgeType": "large",
|
|||
|
|
"mysqlSchemas": [],
|
|||
|
|
"enableRunCode": true,
|
|||
|
|
"enableTestMode": false,
|
|||
|
|
"enableDebugger": true,
|
|||
|
|
"envInfo": "{\"cpp\": [\"C++\", \"<p>Compiled with <code> clang 11 </code> using the latest C++ 17 standard.</p>\\r\\n\\r\\n<p>Your code is compiled with level two optimization (<code>-O2</code>). <a href=\\\"https://github.com/google/sanitizers/wiki/AddressSanitizer\\\" target=\\\"_blank\\\">AddressSanitizer</a> is also enabled to help detect out-of-bounds and use-after-free bugs.</p>\\r\\n\\r\\n<p>Most standard library headers are already included automatically for your convenience.</p>\"], \"java\": [\"Java\", \"<p><code> OpenJDK 17 </code>. Java 8 features such as lambda expressions and stream API can be used. </p>\\r\\n\\r\\n<p>Most standard library headers are already included automatically for your convenience.</p>\\r\\n<p>Includes <code>Pair</code> class from https://docs.oracle.com/javase/8/javafx/api/javafx/util/Pair.html.</p>\"], \"python\": [\"Python\", \"<p><code>Python 2.7.12</code>.</p>\\r\\n\\r\\n<p>Most libraries are already imported automatically for your convenience, such as <a href=\\\"https://docs.python.org/2/library/array.html\\\" target=\\\"_blank\\\">array</a>, <a href=\\\"https://docs.python.org/2/library/bisect.html\\\" target=\\\"_blank\\\">bisect</a>, <a href=\\\"https://docs.python.org/2/library/collections.html\\\" target=\\\"_blank\\\">collections</a>. If you need more libraries, you can import it yourself.</p>\\r\\n\\r\\n<p>For Map/TreeMap data structure, you may use <a href=\\\"http://www.grantjenks.com/docs/sortedcontainers/\\\" target=\\\"_blank\\\">sortedcontainers</a> library.</p>\\r\\n\\r\\n<p>Note that Python 2.7 <a href=\\\"https://www.python.org/dev/peps/pep-0373/\\\" target=\\\"_blank\\\">will not be maintained past 2020</a>. For the latest Python, please choose Python3 instead.</p>\"], \"c\": [\"C\", \"<p>Compiled with <code>gcc 8.2</code> using the gnu11 standard.</p>\\r\\n\\r\\n<p>Your code is compiled with level one optimization (<code>-O1</code>). <a href=\\\"https://github.com/google/sanitizers/wiki/AddressSanitizer\\\" target=\\\"_blank\\\">AddressSanitizer</a> is also enabled to help detect out-of-bounds and use-after-free bugs.</p>\\r\\n\\r\\n<p>Most standard library headers are already included automatically for your convenience.</p>\\r\\n\\r\\n<p>For hash table operations, you may use <a href=\\\"https://troydhanson.github.io/uthash/\\\" target=\\\"_blank\\\">uthash</a>. \\\"uthash.h\\\" is included by default. Below are some examples:</p>\\r\\n\\r\\n<p><b>1. Adding an item to a hash.</b>\\r\\n<pre>\\r\\nstruct hash_entry {\\r\\n int id; /* we'll use this field as the key */\\r\\n char name[10];\\r\\n UT_hash_handle hh; /* makes this structure hashable */\\r\\n};\\r\\n\\r\\nstruct hash_entry *users = NULL;\\r\\n\\r\\nvoid add_user(struct hash_entry *s) {\\r\\n HASH_ADD_INT(users, id, s);\\r\\n}\\r\\n</pre>\\r\\n</p>\\r\\n\\r\\n<p><b>2. Looking up an item in a hash:</b>\\r\\n<pre>\\r\\nstruct hash_entry *find_user(int user_id) {\\r\\n struct hash_entry *s;\\r\\n HASH_FIND_INT(users, &user_id, s);\\r\\n return s;\\r\\n}\\r\\n</pre>\\r\\n</p>\\r\\n\\r\\n<p><b>3. Deleting an item in a hash:</b>\\r\\n<pre>\\r\\nvoid delete_user(struct hash_entry *user) {\\r\\n HASH_DEL(users, user); \\r\\n}\\r\\n</pre>\\r\\n</p>\"], \"csharp\": [\"C#\", \"<p><a href=\\\"https://docs.microsoft.com/en-us/dotnet/csharp/whats-new/csharp-9\\\" target=\\\"_blank\\\">C# 10 with .NET 6 runtime</a></p>\"], \"javascript\": [\"JavaScript\", \"<p><code>Node.js 16.13.2</code>.</p>\\r\\n\\r\\n<p>Your code is run with <code>--harmony</code> flag, enabling <a href=\\\"http://node.green/\\\" target=\\\"_blank\\\">new ES6 features</a>.</p>\\r\\n\\r\\n<p><a href=\\\"https://lodash.com\\\" target=\\\"_blank\\\">lodash.js</a> library is included by default.</p>\\r\\n\\r\\n<p>For Priority Queue / Queue data structures, you may use <a href=\\\"https://github.com/datastructures-js/priority-queue\\\" target=\\\"_blank\\\">datastructures-js/priority-queue</a> and <a href=\\\"https://github.com/datastructures-js/queue\\\" target=\\\"_blank\\\">datastructures-js/queue<
|
|||
|
|
"libraryUrl": null,
|
|||
|
|
"adminUrl": null,
|
|||
|
|
"challengeQuestion": null,
|
|||
|
|
"__typename": "QuestionNode"
|
|||
|
|
}
|
|||
|
|
}
|
|||
|
|
}
|