摘要:
题目描述: 解法: class Solution {public: vector twoSum(vector& nums, int target) { unordered_map record; vector res; ... 阅读全文
摘要:
题目描述: 解法: class Solution {public: double findMedianSortedArrays(vector& nums1, vector& nums2) { if(nums1.size()>nums2.s... 阅读全文
摘要:
题目描述: 解法: class Solution {public: int maxArea(vector& height) { int n=height.size(); int right=n-1,left=0; ... 阅读全文
摘要:
题目描述: 解法一: class Solution {public: int maxCoins(vector& nums) { int n=nums.size(); vector> dp(n+2,vector(n+2,0))... 阅读全文