11 2019 档案
摘要：Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Example: Foll
阅读全文
摘要：class Solution { public: int trap(vector<int>& height) { int l = 0, r = height.size()-1, level = 0, water = 0; while (l < r) { int lower = height[height[l] < height[r] ? l++ : r--]; level = max(level,
阅读全文
摘要：1.顺时针： You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Note: You have to rotate the image in-place
阅读全文
摘要：1. Given an array of non-negative integers, you are initially positioned at the first index of the array. Each element in the array represents your ma
阅读全文
摘要：1.Given a set of candidate numbers (candidates) (without duplicates) and a target number (target), find all unique combinations in candidates where th
阅读全文
摘要：Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or
阅读全文
摘要：Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). Y
阅读全文
摘要：Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. Your algorithm's runtime com
阅读全文
