{"id":76216,"date":"2026-02-21T23:50:02","date_gmt":"2026-02-21T15:50:02","guid":{"rendered":"https:\/\/www.wsisp.com\/helps\/76216.html"},"modified":"2026-02-21T23:50:02","modified_gmt":"2026-02-21T15:50:02","slug":"%e3%80%8aleetcode-%e9%a1%ba%e5%ba%8f%e5%88%b7%e9%a2%98%e3%80%8b11-20","status":"publish","type":"post","link":"https:\/\/www.wsisp.com\/helps\/76216.html","title":{"rendered":"\u300aLeetCode \u987a\u5e8f\u5237\u9898\u300b11 -20"},"content":{"rendered":"

11\u3001[\u4e2d\u7b49] \u76db\u6700\u591a\u6c34\u7684\u5bb9\u5668<\/h4>\n

\u53cc\u6307\u9488<\/p>\n

c++<\/h5>\n

class Solution {
\npublic:
\n int maxArea(vector<int>& height) {
\n int left = 0;
\n int right = height.size() – 1;
\n int ret = 0;
\n while (left < right) {
\n int v = min(height[left], height[right]) * (right – left);
\n ret = max(ret, v);<\/p>\n

\/\/ \u79fb\u52a8\u6307\u9488
\n if (height[left] < height[right]) {
\n ++left;
\n } else {
\n –right;
\n }
\n }
\n return ret;
\n }
\n};<\/p>\n

Java<\/h5>\n

class<\/span> Solution<\/span> {<\/span>
\n public<\/span> int<\/span> maxArea<\/span>(<\/span>int<\/span>[<\/span>]<\/span> height)<\/span> {<\/span>
\n int<\/span> left =<\/span> 0<\/span>;<\/span> \/\/ \u5de6\u6307\u9488<\/span>
\n int<\/span> right =<\/span> height.<\/span>length –<\/span> 1<\/span>;<\/span> \/\/ \u53f3\u6307\u9488<\/span>
\n int<\/span> maxArea =<\/span> 0<\/span>;<\/span> \/\/ \u6700\u5927\u9762\u79ef<\/span><\/p>\n

while<\/span> (<\/span>left <<\/span> right)<\/span> {<\/span>
\n \/\/ \u8ba1\u7b97\u5f53\u524d\u5bb9\u5668\u7684\u9762\u79ef<\/span>
\n int<\/span> currentArea =<\/span> Math<\/span>.<\/span>min<\/span>(<\/span>height[<\/span>left]<\/span>,<\/span> height[<\/span>right]<\/span>)<\/span> *<\/span> (<\/span>right –<\/span> left)<\/span>;<\/span>
\n \/\/ \u66f4\u65b0\u6700\u5927\u9762\u79ef<\/span>
\n maxArea =<\/span> Math<\/span>.<\/span>max<\/span>(<\/span>maxArea,<\/span> currentArea)<\/span>;<\/span><\/p>\n

\/\/ \u79fb\u52a8\u6307\u9488<\/span>
\n if<\/span> (<\/span>height[<\/span>left]<\/span> <<\/span> height[<\/span>right]<\/span>)<\/span> {<\/span>
\n left++<\/span>;<\/span> \/\/ \u5982\u679c\u5de6\u8fb9\u9ad8\u5ea6\u8f83\u5c0f，\u79fb\u52a8\u5de6\u6307\u9488<\/span>
\n }<\/span> else<\/span> {<\/span>
\n right—<\/span>;<\/span> \/\/ \u5982\u679c\u53f3\u8fb9\u7684\u9ad8\u5ea6\u8f83\u5c0f，\u79fb\u52a8\u53f3\u6307\u9488<\/span>
\n }<\/span>
\n }<\/span><\/p>\n

return<\/span> maxArea;<\/span>
\n }<\/span>
\n}<\/span><\/p>\n

12\u3001[\u4e2d\u7b49] \u6574\u6570\u8f6c\u7f57\u9a6c\u6570\u5b57<\/h4>\n

\u6570\u5b66 \u5b57\u7b26\u4e32<\/p>\n

\u6a21\u62df<\/p>\n

const pair<int, string> valueSymbols[] = {
\n {1000, "M"}, {900, "CM"}, {500, "D"}, {400, "CD"}, {100, "C"},
\n {90, "XC"}, {50, "L"}, {40, "XL"}, {10, "X"}, {9, "IX"},
\n {5, "V"}, {4, "IV"}, {1, "I"},
\n};<\/p>\n

class Solution {
\npublic:
\n string intToRoman(int num) {
\n string roman;
\n for (const auto& [value, symbol] : valueSymbols) {
\n while (num >= value) {
\n num -= value;
\n roman += symbol;
\n }
\n if (num == 0) {
\n break;
\n }
\n }
\n return roman;
\n }
\n};<\/p>\n

\u786c\u7f16\u7801\u6570\u5b57<\/p>\n

const string thousands[] = {"", "M", "MM", "MMM"};
\nconst string hundreds[] = {"", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"};
\nconst string tens[] = {"", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"};
\nconst string ones[] = {"", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"};<\/p>\n

class Solution {
\npublic:
\n string intToRoman(int num) {
\n return thousands[num \/ 1000] + hundreds[num % 1000 \/ 100] + tens[num % 100 \/ 10] + ones[num % 10];
\n }
\n};<\/p>\n

13\u3001[\u7b80\u5355] \u7f57\u9a6c\u6570\u5b57\u8f6c\u6574\u6570<\/h4>\n

\u54c8\u5e0c\u8868 \u6570\u5b66 \u5b57\u7b26\u4e32<\/p>\n

class Solution {
\nprivate:
\n unordered_map<char, int> symbolValue = {{'I', 1}, {'V', 5}, {'X', 10}, {'L', 50}, {'C', 100}, {'D', 500}, {'M', 1000}};<\/p>\n

public:
\n int romanToInt(string s) {
\n int ret = 0;
\n int n = s.size();
\n for (int i = 0; i < n; ++i) {
\n int value = symbolValue[s[i]];
\n if (i < n – 1 && value < symbolValue[s[i + 1]]) {
\n ret -= value;
\n } else {
\n ret += value;
\n }
\n }
\n return ret;
\n }
\n};<\/p>\n

14\u3001[\u7b80\u5355] \u6700\u957f\u516c\u5171\u524d\u7f00<\/h4>\n

\u5b57\u7b26\u4e32 \u4e8c\u5206\u67e5\u627e<\/p>\n

\u6a2a\u5411\u626b\u63cf<\/p>\n

class Solution {
\npublic:
\n string longestCommonPrefix(vector<string>& strs) {
\n \/\/ \u89e3\u6cd5\u4e00：\u4e24\u4e24\u6bd4\u8f83
\n string ret = strs[0];
\n for (int i = 1; i < strs.size(); i++) {
\n ret = findCommon(ret, strs[i]);
\n }
\n return ret;
\n }<\/p>\n

string findCommon(string& s1, string& s2)
\n {
\n int i = 0;
\n while (i < min(s1.size(), s2.size()) && s1[i] == s2[i]) {
\n i++;
\n }
\n return s1.substr(0, i);
\n }
\n};<\/p>\n

\u7eb5\u5411\u626b\u63cf<\/p>\n

class Solution {
\npublic:
\n string longestCommonPrefix(vector<string>& strs) {
\n if (!strs.size()) {
\n return "";
\n }<\/p>\n

int length = strs[0].size();
\n int count = strs.size();
\n for (int i = 0; i < length; i++) {
\n char c = strs[0][i];
\n for (int j = 1; j < count; j++) {
\n if (i == strs[j].size() || strs[j][i] != c) {
\n return strs[0].substr(0, i);
\n }
\n }
\n }<\/p>\n

return strs[0];
\n }
\n};<\/p>\n

\u5206\u6cbb<\/p>\n

class Solution {
\npublic:
\n string longestCommonPrefix(vector<string>& strs) {
\n if (!strs.size()) {
\n return "";
\n } else {
\n return longestCommonPrefix(strs, 0, strs.size() – 1);
\n }
\n }<\/p>\n

string longestCommonPrefix(const vector<string>& strs, int start, int end) {
\n if (start == end) {
\n return strs[start];
\n } else {
\n int mid = (start + end) \/ 2;
\n string lcpLeft = longestCommonPrefix(strs, start, mid);
\n string lcpRight = longestCommonPrefix(strs, mid + 1, end);
\n return commonPrefix(lcpLeft, lcpRight);
\n }
\n }<\/p>\n

string commonPrefix(const string& lcpLeft, const string& lcpRight) {
\n int minLength = min(lcpLeft.size(), lcpRight.size());
\n for (int i = 0; i < minLength; i++) {
\n if (lcpLeft[i] != lcpRight[i]) {
\n return lcpLeft.substr(0, i);
\n }
\n }
\n return lcpLeft.substr(0, minLength);
\n }
\n};<\/p>\n

\u6392\u5e8f<\/p>\n

class Solution {
\npublic:
\n string longestCommonPrefix(vector<string>& strs) {
\n if (strs.empty()) {
\n return "";
\n }<\/p>\n

sort(strs.begin(), strs.end());
\n string start = strs.front();
\n string end = strs.back();
\n int n = min(start.size(), end.size());
\n int i = 0;
\n for (i = 0; i < n && start[i] == end[i]; i++)
\n ;<\/p>\n

return string(start, 0, i);
\n }
\n};<\/p>\n

15\u3001[\u4e2d\u7b49] \u4e09\u6570\u4e4b\u548c<\/h4>\n

\u6392\u5e8f \u6570\u7ec4 \u53cc\u6307\u9488<\/p>\n

class Solution {
\npublic:
\n vector<vector<int>> threeSum(vector<int>& nums) {
\n sort(nums.begin(), nums.end());
\n vector<vector<int>> ret;<\/p>\n

int n = nums.size();
\n for (int i = 0; i < n; ++i) {
\n if (nums[i] > 0) {
\n break;
\n }
\n int left = i + 1;
\n int right = n – 1;
\n int target = -nums[i];<\/p>\n

while (left < right) {
\n int sum = nums[left] + nums[right];
\n if (sum > target) {
\n –right;
\n } else if (sum < target) {
\n ++left;
\n } else {
\n ret.push_back({nums[i], nums[left], nums[right]});
\n ++left;
\n –right;<\/p>\n

while (left < right && nums[left] == nums[left – 1]) {
\n ++left;
\n }
\n while(left < right && nums[right] == nums[right + 1]) {
\n –right;
\n }
\n }
\n }<\/p>\n

while (i < n – 1 && nums[i] == nums[i + 1]) {
\n ++i;
\n }
\n }<\/p>\n

return ret;
\n }
\n};<\/p>\n

16\u3001[\u4e2d\u7b49] \u6700\u63a5\u8fd1\u7684\u4e09\u6570\u4e4b\u548c<\/h4>\n

\u6392\u5e8f \u6570\u7ec4 \u53cc\u6307\u9488<\/p>\n

class Solution {
\npublic:
\n int threeSumClosest(vector<int>& nums, int target) {
\n sort(nums.begin(), nums.end());
\n int n = nums.size();
\n int ret = 1e7;<\/p>\n

\/\/ \u6839\u636e\u5dee\u503c\u7684\u7edd\u5bf9\u503c\u6765\u66f4\u65b0\u7b54\u6848
\n auto update = [&](int cur) {
\n if (abs(cur – target) < abs(ret – target)) {
\n ret = cur;
\n }
\n };<\/p>\n

\/\/ \u679a\u4e3e a
\n for (int i = 0; i < nums.size(); i++) {
\n \/\/ \u4fdd\u8bc1\u548c\u4e0a\u4e00\u6b21\u679a\u4e3e\u7684\u5143\u7d20\u4e0d\u76f8\u7b49
\n if (i > 0 && nums[i] == nums[i – 1]) {
\n continue;
\n }<\/p>\n

\/\/ \u4f7f\u7528\u53cc\u6307\u9488\u679a\u4e3e b \u548c c
\n int left = i + 1, right = n – 1;
\n while (left < right) {
\n int sum = nums[i] + nums[left] + nums[right];
\n \/\/ \u5982\u679c\u548c\u4e3a target \u76f4\u63a5\u8fd4\u56de\u7b54\u6848
\n if (sum == target) {
\n return target;
\n }<\/p>\n

update(sum);
\n if (sum > target) {
\n \/\/ \u5982\u679c\u548c\u5927\u4e8e target，\u79fb\u52a8 c \u5bf9\u5e94\u7684\u6307\u9488
\n right–;
\n while (left < right && nums[right] == nums[right + 1]) {
\n right–;
\n }<\/p>\n

} else {
\n \/\/ \u5982\u679c\u548c\u5c0f\u4e8e target，\u79fb\u52a8 b \u5bf9\u5e94\u7684\u6307\u9488
\n left++;
\n while (left < right && nums[left] == nums[left – 1]) {
\n left++;
\n }
\n }
\n }
\n }<\/p>\n

return ret;
\n }
\n};<\/p>\n

17\u3001[\u4e2d\u7b49] \u7535\u8bdd\u53f7\u7801\u7684\u5b57\u6bcd\u7ec4\u5408<\/h4>\n

\u54c8\u5e0c\u8868 \u5b57\u7b26\u4e32 \u56de\u6eaf<\/p>\n

class Solution {
\nprivate:
\n string hash[10] = {"", "", "abc", "def", "ghi", "jkl", "mno", "pqrs", "tuv", "wxyz"};
\n string path;
\n vector<string> ret;<\/p>\n

void dfs(string& digits, int pos) {
\n if (pos == digits.size()) {
\n ret.push_back(path);
\n return;
\n }
\n for (const auto& ch : hash[digits[pos] – '0']) {
\n path.push_back(ch);
\n dfs(digits, pos + 1);
\n path.pop_back();
\n }
\n }<\/p>\n

public:
\n vector<string> letterCombinations(string digits) {
\n if (digits.empty()) {
\n return {};
\n }
\n dfs(digits, 0);
\n return ret;
\n }
\n};<\/p>\n

18\u3001[\u4e2d\u7b49] \u56db\u6570\u4e4b\u548c<\/h4>\n

\u6392\u5e8f \u6570\u7ec4 \u53cc\u6307\u9488<\/p>\n

class Solution {
\npublic:
\n vector<vector<int>> fourSum(vector<int>& nums, int target) {
\n int n = nums.size();
\n if (n < 4) {
\n return {};
\n }
\n vector<vector<int>> ret;
\n sort(nums.begin(), nums.end());<\/p>\n

for (int i = 0; i < n – 3; i++) {
\n for (int j = i + 1; j < n – 2; j++) {
\n long long newtarget = (long long)target – nums[i] – nums[j];
\n int left = j + 1, right = n – 1;
\n while (left < right) {
\n int sum = nums[left] + nums[right];
\n if (sum > newtarget) {
\n right–;
\n } else if (sum < newtarget) {
\n left++;
\n } else {
\n ret.push_back({nums[i], nums[j], nums[left++], nums[right–]});<\/p>\n

\/\/ \u53bb\u91cd
\n while (left < right && nums[left] == nums[left – 1]) {
\n left++;
\n }
\n while (left < right && nums[right] == nums[right + 1]) {
\n right–;
\n }
\n }
\n }<\/p>\n

while (j < n – 2 && nums[j] == nums[j + 1]) {
\n j++;
\n }
\n }<\/p>\n

while (i < n – 3 && nums[i] == nums[i + 1]) {
\n i++;
\n }
\n }<\/p>\n

return ret;
\n }
\n};<\/p>\n

19\u3001[\u4e2d\u7b49] \u5220\u9664\u94fe\u8868\u7684\u5012\u6570\u7b2c N \u4e2a\u8282\u70b9<\/h4>\n

\u6808 \u94fe\u8868 \u53cc\u6307\u9488<\/p>\n

\u8ba1\u7b97\u94fe\u8868\u7684\u957f\u5ea6<\/p>\n

class Solution {
\npublic:
\n ListNode* removeNthFromEnd(ListNode* head, int n) {
\n ListNode* newhead = new ListNode(0, head);
\n int count = 0;
\n ListNode* cur = head;
\n while (cur) {
\n cur = cur->next;
\n count++;
\n }<\/p>\n

int gap = count – n;
\n cur = newhead;
\n while (gap–)
\n cur = cur->next;
\n ListNode* del = cur->next;
\n cur->next = del->next;
\n cur = newhead->next;<\/p>\n

delete del;
\n delete newhead;
\n return cur;
\n }
\n};<\/p>\n

\u6808<\/p>\n

class Solution {
\npublic:
\n ListNode* removeNthFromEnd(ListNode* head, int n) {
\n ListNode* newhead = new ListNode(0, head);
\n stack<ListNode*> s;
\n ListNode* cur = newhead;
\n while (cur) {
\n s.push(cur);
\n cur = cur->next;
\n }
\n for (int i = 0; i < n; ++i) {
\n s.pop();
\n }
\n ListNode* prev = s.top();
\n ListNode* del = prev->next;
\n prev->next = del->next;
\n cur = newhead->next;
\n delete del;
\n delete newhead;
\n return cur;
\n }
\n};<\/p>\n

\u53cc\u6307\u9488<\/p>\n

class Solution {
\npublic:
\n ListNode* removeNthFromEnd(ListNode* head, int n) {
\n ListNode newhead;
\n newhead.next = head;
\n ListNode* slow = &newhead;
\n ListNode* fast = &newhead;
\n while (n–) {
\n fast = fast->next;
\n }
\n while (fast->next) {
\n slow = slow->next;
\n fast = fast->next;
\n }
\n ListNode* del = slow->next;
\n slow->next = del->next;
\n delete del;
\n return newhead.next;
\n }
\n};<\/p>\n

20\u3001[\u7b80\u5355] \u6709\u6548\u7684\u62ec\u53f7<\/h4>\n

\u6808 \u54c8\u5e0c\u8868 \u5b57\u7b26\u4e32<\/p>\n

class Solution {
\npublic:
\n bool isValid(string s) {
\n int n = s.size();
\n stack<char> st;<\/p>\n

for (int i = 0; i < n; i++) {
\n if (s[i] == '(' || s[i] == '{' || s[i] == '[')
\n st.push(s[i]);
\n else if (s[i] == ')' && !st.empty() && st.top() == '(')
\n st.pop();
\n else if (s[i] == '}' && !st.empty() && st.top() == '{')
\n st.pop();
\n else if (s[i] == ']' && !st.empty() && st.top() == '[')
\n st.pop();
\n else
\n return false;
\n }<\/p>\n

return st.empty() == true;
\n }
\n};<\/p>\n

class Solution {
\npublic:
\n bool isValid(string s) {
\n int n = s.size();
\n if (n % 2 == 1)
\n return false;<\/p>\n

unordered_map<char, char> pairs = {{')', '('}, {']', '['}, {'}', '{'}};
\n stack<char> stk;
\n for (const char& ch : s) {
\n if (pairs.count(ch)) {
\n if (stk.empty() || stk.top() != pairs[ch])
\n return false;
\n stk.pop();
\n } else
\n stk.push(ch);
\n }<\/p>\n

return stk.empty();
\n }
\n};<\/p>\n","protected":false},"excerpt":{"rendered":"

11\u3001[\u4e2d\u7b49] \u76db\u6700\u591a\u6c34\u7684\u5bb9\u5668
\n\u53cc\u6307\u9488
\nc
\nclass Solution {
\npublic:int maxArea(vector& height) {int left 0;int right height.size() – 1;int ret 0;while (left < right) {int v min(height[left], height[right]) * (right – left);ret max(ret, v);\/\/ \u79fb\u52a8\u6307\u9488if<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[8185,55,99,2692,81,427],"topic":[],"class_list":["post-76216","post","type-post","status-publish","format-standard","hentry","category-server","tag-lenyiin","tag-c","tag-java","tag-leetcode","tag-python","tag-427"],"yoast_head":"\n\u300aLeetCode \u987a\u5e8f\u5237\u9898\u300b11 -20 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.wsisp.com\/helps\/76216.html\" \/>\n<meta property=\"og:locale\" content=\"zh_CN\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"\u300aLeetCode \u987a\u5e8f\u5237\u9898\u300b11 -20 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\" \/>\n<meta property=\"og:description\" content=\"11\u3001[\u4e2d\u7b49] \u76db\u6700\u591a\u6c34\u7684\u5bb9\u5668 \u53cc\u6307\u9488 c class Solution { public:int maxArea(vector& height) {int left 0;int right height.size() - 1;int ret 0;while (left < right) {int v min(height[left], height[right]) * (right - left);ret max(ret, v);\/\/ \u79fb\u52a8\u6307\u9488if\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.wsisp.com\/helps\/76216.html\" \/>\n<meta property=\"og:site_name\" content=\"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\" \/>\n<meta property=\"article:published_time\" content=\"2026-02-21T15:50:02+00:00\" \/>\n<meta name=\"author\" content=\"admin\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"\u4f5c\u8005\" \/>\n\t<meta name=\"twitter:data1\" content=\"admin\" \/>\n\t<meta name=\"twitter:label2\" content=\"\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4\" \/>\n\t<meta name=\"twitter:data2\" content=\"7 \u5206\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/76216.html\",\"url\":\"https:\/\/www.wsisp.com\/helps\/76216.html\",\"name\":\"\u300aLeetCode \u987a\u5e8f\u5237\u9898\u300b11 -20 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\",\"isPartOf\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/#website\"},\"datePublished\":\"2026-02-21T15:50:02+00:00\",\"dateModified\":\"2026-02-21T15:50:02+00:00\",\"author\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41\"},\"breadcrumb\":{\"@id\":\"https:\/\/www.wsisp.com\/helps\/76216.html#breadcrumb\"},\"inLanguage\":\"zh-Hans\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/www.wsisp.com\/helps\/76216.html\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/76216.html#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"\u9996\u9875\",\"item\":\"https:\/\/www.wsisp.com\/helps\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"\u300aLeetCode \u987a\u5e8f\u5237\u9898\u300b11 -20\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#website\",\"url\":\"https:\/\/www.wsisp.com\/helps\/\",\"name\":\"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3\",\"description\":\"\u9999\u6e2f\u670d\u52a1\u5668_\u9999\u6e2f\u4e91\u670d\u52a1\u5668\u8d44\u8baf_\u670d\u52a1\u5668\u5e2e\u52a9\u6587\u6863_\u670d\u52a1\u5668\u6559\u7a0b\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/www.wsisp.com\/helps\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"zh-Hans\"},{\"@type\":\"Person\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41\",\"name\":\"admin\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"zh-Hans\",\"@id\":\"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery\",\"contentUrl\":\"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery\",\"caption\":\"admin\"},\"sameAs\":[\"http:\/\/wp.wsisp.com\"],\"url\":\"https:\/\/www.wsisp.com\/helps\/author\/admin\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"\u300aLeetCode \u987a\u5e8f\u5237\u9898\u300b11 -20 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.wsisp.com\/helps\/76216.html","og_locale":"zh_CN","og_type":"article","og_title":"\u300aLeetCode \u987a\u5e8f\u5237\u9898\u300b11 -20 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","og_description":"11\u3001[\u4e2d\u7b49] \u76db\u6700\u591a\u6c34\u7684\u5bb9\u5668 \u53cc\u6307\u9488 c class Solution { public:int maxArea(vector& height) {int left 0;int right height.size() - 1;int ret 0;while (left < right) {int v min(height[left], height[right]) * (right - left);ret max(ret, v);\/\/ \u79fb\u52a8\u6307\u9488if","og_url":"https:\/\/www.wsisp.com\/helps\/76216.html","og_site_name":"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","article_published_time":"2026-02-21T15:50:02+00:00","author":"admin","twitter_card":"summary_large_image","twitter_misc":{"\u4f5c\u8005":"admin","\u9884\u8ba1\u9605\u8bfb\u65f6\u95f4":"7 \u5206"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/www.wsisp.com\/helps\/76216.html","url":"https:\/\/www.wsisp.com\/helps\/76216.html","name":"\u300aLeetCode \u987a\u5e8f\u5237\u9898\u300b11 -20 - \u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","isPartOf":{"@id":"https:\/\/www.wsisp.com\/helps\/#website"},"datePublished":"2026-02-21T15:50:02+00:00","dateModified":"2026-02-21T15:50:02+00:00","author":{"@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41"},"breadcrumb":{"@id":"https:\/\/www.wsisp.com\/helps\/76216.html#breadcrumb"},"inLanguage":"zh-Hans","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.wsisp.com\/helps\/76216.html"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.wsisp.com\/helps\/76216.html#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"\u9996\u9875","item":"https:\/\/www.wsisp.com\/helps"},{"@type":"ListItem","position":2,"name":"\u300aLeetCode \u987a\u5e8f\u5237\u9898\u300b11 -20"}]},{"@type":"WebSite","@id":"https:\/\/www.wsisp.com\/helps\/#website","url":"https:\/\/www.wsisp.com\/helps\/","name":"\u7f51\u7855\u4e92\u8054\u5e2e\u52a9\u4e2d\u5fc3","description":"\u9999\u6e2f\u670d\u52a1\u5668_\u9999\u6e2f\u4e91\u670d\u52a1\u5668\u8d44\u8baf_\u670d\u52a1\u5668\u5e2e\u52a9\u6587\u6863_\u670d\u52a1\u5668\u6559\u7a0b","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.wsisp.com\/helps\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"zh-Hans"},{"@type":"Person","@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/358e386c577a3ab51c4493330a20ad41","name":"admin","image":{"@type":"ImageObject","inLanguage":"zh-Hans","@id":"https:\/\/www.wsisp.com\/helps\/#\/schema\/person\/image\/","url":"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery","contentUrl":"https:\/\/gravatar.wp-china-yes.net\/avatar\/?s=96&d=mystery","caption":"admin"},"sameAs":["http:\/\/wp.wsisp.com"],"url":"https:\/\/www.wsisp.com\/helps\/author\/admin"}]}},"_links":{"self":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts\/76216","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/comments?post=76216"}],"version-history":[{"count":0,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/posts\/76216\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/media?parent=76216"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/categories?post=76216"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/tags?post=76216"},{"taxonomy":"topic","embeddable":true,"href":"https:\/\/www.wsisp.com\/helps\/wp-json\/wp\/v2\/topic?post=76216"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}