# Best Time to Buy and Sell Stock III - LeetCode 123

Say you have an array for which the ith element is the price of a given stock on day i. Design an algorithm to find the maximum profit. You may complete at most two transactions. Note: You may not ...

# Perfect Squares - LeetCode 279

Given a positive integer n, find the least number of perfect square numbers (for example, 1, 4, 9, 16, ...) which sum to n. For example, given n = 12, return 3 because 12 = 4 + 4 + 4; given n =...

# Missing Number - LetcCode 268

Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. For example, Given nums = [0, 1, 3] return 2. Note: Your algorithm should ru...

# Product of Array Except Self - LeetCode 238

Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i]. Solve it without division and in O(n...

# Gas Station - LeetCode 134

There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to it...

# Bitwise AND of Numbers Range - LeetCode 201

99条 共5页1 2 3 4 5 ... 下一页 尾页
个人资料
• 访问：28403次
• 积分：1212
• 等级：
• 排名：千里之外
• 原创：97篇
• 转载：2篇
• 译文：0篇
• 评论：0条
文章分类
阅读排行