FPEvalRepoPublic/LeetCodeMetaData

1{2  "id": 2669,3  "name": "find-the-substring-with-maximum-cost",4  "difficulty": "Medium",5  "link": "https://leetcode.com/problems/find-the-substring-with-maximum-cost/",6  "date": "2023-03-18",7  "task_description": "You are given a string `s`, a string `chars` of **distinct** characters and an integer array `vals` of the same length as `chars`. The **cost of the substring **is the sum of the values of each character in the substring. The cost of an empty string is considered `0`. The **value of the character **is defined in the following way: If the character is not in the string `chars`, then its value is its corresponding position **(1-indexed)** in the alphabet. For example, the value of `'a'` is `1`, the value of `'b'` is `2`, and so on. The value of `'z'` is `26`. Otherwise, assuming `i` is the index where the character occurs in the string `chars`, then its value is `vals[i]`. Return _the maximum cost among all substrings of the string_ `s`. **Example 1:** ``` **Input:** s = \"adaa\", chars = \"d\", vals = [-1000] **Output:** 2 **Explanation:** The value of the characters \"a\" and \"d\" is 1 and -1000 respectively. The substring with the maximum cost is \"aa\" and its cost is 1 + 1 = 2. It can be proven that 2 is the maximum cost. ``` **Example 2:** ``` **Input:** s = \"abc\", chars = \"abc\", vals = [-1,-1,-1] **Output:** 0 **Explanation:** The value of the characters \"a\", \"b\" and \"c\" is -1, -1, and -1 respectively. The substring with the maximum cost is the empty substring \"\" and its cost is 0. It can be proven that 0 is the maximum cost. ``` **Constraints:** `1 <= s.length <= 105` `s` consist of lowercase English letters. `1 <= chars.length <= 26` `chars` consist of **distinct** lowercase English letters. `vals.length == chars.length` `-1000 <= vals[i] <= 1000`",8  "test_case": [9    {10      "label": "Example 1",11      "input": "s = \"adaa\", chars = \"d\", vals = [-1000]",12      "output": "2 "13    },14    {15      "label": "Example 2",16      "input": "s = \"abc\", chars = \"abc\", vals = [-1,-1,-1]",17      "output": "0 "18    }19  ],20  "constraints": [21    "If the character is not in the string chars, then its value is its corresponding position (1-indexed) in the alphabet.\n\n\t\nFor example, the value of 'a' is 1, the value of 'b' is 2, and so on. The value of 'z' is 26.",22    "For example, the value of 'a' is 1, the value of 'b' is 2, and so on. The value of 'z' is 26.",23    "Otherwise, assuming i is the index where the character occurs in the string chars, then its value is vals[i].",24    "For example, the value of 'a' is 1, the value of 'b' is 2, and so on. The value of 'z' is 26.",25    "1 <= s.length <= 105",26    "s consist of lowercase English letters.",27    "1 <= chars.length <= 26",28    "chars consist of distinct lowercase English letters.",29    "vals.length == chars.length",30    "-1000 <= vals[i] <= 1000"31  ],32  "python_template": "class Solution(object):\n    def maximumCostSubstring(self, s, chars, vals):\n        \"\"\"\n        :type s: str\n        :type chars: str\n        :type vals: List[int]\n        :rtype: int\n        \"\"\"\n        ",33  "java_template": "class Solution {\n    public int maximumCostSubstring(String s, String chars, int[] vals) {\n        \n    }\n}",34  "metadata": {35    "func_name": "maximumCostSubstring"36  }37}