![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Array
lyangpku
这个作者很懒,什么都没留下…
展开
-
[LeetCode] Largest Rectangle in Histogram
class Solution {public: int largestRectangleArea(vector &height) { // Start typing your C/C++ solution below // DO NOT write int main() function int n = height.size();原创 2013-01-25 02:02:25 · 409 阅读 · 0 评论 -
[LeetCode] Rotate Image
class Solution {public: void rotate(vector > &matrix) { // Start typing your C/C++ solution below // DO NOT write int main() function int n = matrix.size(); if (n原创 2013-01-28 17:39:45 · 473 阅读 · 0 评论 -
[LeetCode] Best Time to Buy and Sell Stock II
class Solution {public: int maxProfit(vector &prices) { // Start typing your C/C++ solution below // DO NOT write int main() function int ret = 0; for (int i = 1;原创 2013-01-28 19:42:49 · 365 阅读 · 0 评论 -
[LeetCode] Pascal's Triangle II
class Solution {public: vector getRow(int rowIndex) { // Start typing your C/C++ solution below // DO NOT write int main() function vector ret(rowIndex + 1, 1);原创 2013-01-29 00:29:11 · 347 阅读 · 0 评论 -
[LeetCode] Two Sum
struct Wrapper { int val; int pos;};bool compare(const Wrapper &w1, const Wrapper &w2) { return w1.val < w2.val;}class Solution {public: vector twoSum(vector &numbers, int targe原创 2013-01-29 00:39:08 · 444 阅读 · 0 评论 -
[LeetCode] 3Sum
class Solution {public: vector > threeSum(vector &num) { // Start typing your C/C++ solution below // DO NOT write int main() function vector > ret; if (num.empty(原创 2013-01-29 18:02:12 · 408 阅读 · 0 评论 -
[LeetCode] 3Sum Closest
class Solution {public: int threeSumClosest(vector &num, int target) { // Start typing your C/C++ solution below // DO NOT write int main() function if (num.size() < 3) re原创 2013-01-29 18:11:05 · 390 阅读 · 0 评论 -
[LeetCode] Best Time to Buy and Sell Stock
class Solution {public: int maxProfit(vector &prices) { // Start typing your C/C++ solution below // DO NOT write int main() function if (prices.empty()) return 0;原创 2013-01-28 19:40:42 · 277 阅读 · 0 评论 -
[LeetCode] Best Time to Buy and Sell Stock III
class Solution {public: int maxProfit(vector &prices) { // Start typing your C/C++ solution below // DO NOT write int main() function int n = prices.size(); if (n原创 2013-01-28 19:47:43 · 302 阅读 · 0 评论 -
[LeetCode] Remove Element
class Solution {public: int removeElement(int A[], int n, int elem) { // Start typing your C/C++ solution below // DO NOT write int main() function int i = 0;原创 2013-01-28 17:44:55 · 331 阅读 · 0 评论 -
[LeetCode] Remove Duplicates from Sorted Array
class Solution {public: int removeDuplicates(int A[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function if (n == 0) return 0;原创 2013-01-28 17:50:43 · 357 阅读 · 0 评论 -
[LeetCode] Pascal's Triangle
class Solution {public: vector > generate(int numRows) { // Start typing your C/C++ solution below // DO NOT write int main() function vector > ret; if (n原创 2013-01-29 00:29:20 · 336 阅读 · 0 评论 -
[LeetCode] Container With Most Water
struct Wrapper { int val; int pos;};bool compare(const Wrapper &w1, const Wrapper &w2) { return w1.val > w2.val;}class Solution {public: int maxArea(vector &height) { //原创 2013-01-29 10:57:37 · 416 阅读 · 0 评论 -
[LeetCode] Plus One
class Solution {public: vector plusOne(vector &digits) { // Start typing your C/C++ solution below // DO NOT write int main() function int carry = 1; for原创 2013-01-27 19:57:54 · 291 阅读 · 0 评论 -
[LeetCode] Maximum Subarray
class Solution {public: int maxSubArray(int A[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function int ret = A[0]; int sum = 0原创 2013-01-28 14:45:34 · 382 阅读 · 0 评论 -
[LeetCode] Remove Duplicates from Sorted Array II
class Solution {public: int removeDuplicates(int A[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function if (n <= 2) return n;原创 2013-01-25 02:57:20 · 366 阅读 · 0 评论 -
[LeetCode] Merge Sorted Array
class Solution {public: void merge(int A[], int m, int B[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function if (n == 0) return;原创 2013-01-24 20:22:02 · 348 阅读 · 0 评论 -
[LeetCode] Maximal Rectangle
class Solution {public: int f(vector &v) { int n = v.size(); vector left(n); vector right(n); for (int i = 0; i < n; i++) { left[i] =原创 2013-01-25 02:14:25 · 335 阅读 · 0 评论 -
[LeetCode] Set Matrix Zeroes
class Solution {public: void setZeroes(vector > &matrix) { // Start typing your C/C++ solution below // DO NOT write int main() function int m = matrix.size(); if原创 2013-01-26 15:47:57 · 339 阅读 · 0 评论 -
[LeetCode] Add Binary
class Solution {public: string addBinary(string a, string b) { // Start typing your C/C++ solution below // DO NOT write int main() function int m = a.size(); int原创 2013-01-27 20:39:56 · 327 阅读 · 0 评论 -
[LeetCode] Spiral Matrix
class Solution {public: vector spiralOrder(vector > &matrix) { // Start typing your C/C++ solution below // DO NOT write int main() function vector ret; i原创 2013-01-28 14:33:39 · 317 阅读 · 0 评论 -
[LeetCode] Jump Game
class Solution {public: bool canJump(int A[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function int pos = 0; int far = 0;原创 2013-01-27 22:28:46 · 299 阅读 · 0 评论 -
[LeetCode] Jump Game II
class Solution {public: int jump(int A[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function if (n == 1) return 0; int原创 2013-01-28 03:20:24 · 1099 阅读 · 2 评论 -
[LeetCode] Insert Interval
/** * Definition for an interval. * struct Interval { * int start; * int end; * Interval() : start(0), end(0) {} * Interval(int s, int e) : start(s), end(e) {} * }; */class So原创 2013-01-28 05:06:04 · 309 阅读 · 0 评论 -
[LeetCode] Merge Intervals
/** * Definition for an interval. * struct Interval { * int start; * int end; * Interval() : start(0), end(0) {} * Interval(int s, int e) : start(s), end(e) {} * }; */bool co原创 2013-01-27 22:17:23 · 394 阅读 · 0 评论 -
[LeetCode] First Missing Positive
class Solution {public: int firstMissingPositive(int A[], int n) { // Start typing your C/C++ solution below // DO NOT write int main() function for (int i = 0; i < n; i++原创 2013-01-28 03:52:16 · 400 阅读 · 0 评论 -
[LeetCode] Spiral Matrix II
class Solution {public: vector > generateMatrix(int n) { // Start typing your C/C++ solution below // DO NOT write int main() function vector > ret(n, vector(n));原创 2013-01-28 14:18:24 · 374 阅读 · 0 评论 -
[LeetCode] Longest Substring Without Repeating Characters
class Solution {public: int lengthOfLongestSubstring(string s) { // Start typing your C/C++ solution below // DO NOT write int main() function vector v(256, -1);原创 2013-01-29 11:24:55 · 524 阅读 · 0 评论