leet
Big Bro
这个作者很懒,什么都没留下…
展开
-
695. 岛屿的最大面积
class Solution {public: int maxAreaOfIsland(vector<vector<int>>& grid) { int max_area=0,area=0; for(int i=0;i<grid.size();i++) { for(int j=0;j<grid[i].size();j++) { .原创 2021-09-07 00:56:21 · 87 阅读 · 0 评论 -
735.图像渲染
class Solution {public: vector<vector<int>> floodFill(vector<vector<int>>& image, int sr, int sc, int newColor) { if(newColor==image[sr][sc])return image; flood(image,sr,sc,newColor,image[sr][sc]);.原创 2021-09-07 00:54:38 · 110 阅读 · 0 评论 -
116.右侧节点
/*// Definition for a Node.class Node {public: int val; Node* left; Node* right; Node* next; Node() : val(0), left(NULL), right(NULL), next(NULL) {} Node(int _val) : val(_val), left(NULL), right(NULL), next(NULL) {} Node(.原创 2021-09-02 01:27:35 · 97 阅读 · 0 评论 -
189.旋转数组
class Solution {public: int GCD(int a,int b) { return a%b?GCD(b,a%b):b; } void rotate(vector<int>& nums, int k) { int numsSize=nums.size(); if(numsSize<=1||k==0) { return; .原创 2021-09-02 00:47:41 · 89 阅读 · 0 评论 -
110.平衡二叉树
/** * Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), left(nullptr), right(nullptr) {} * TreeNode(int x) : val(x), left(nullptr), right(nullptr) {} *.原创 2021-09-01 23:25:39 · 56 阅读 · 0 评论 -
23.合并K个升序链表
class Solution {public: ListNode* mergeKLists(vector<ListNode*>& lists) { int listsSize=lists.size(); //ListNode* head=nullptr; if(listsSize==0) //空vector ..原创 2021-08-23 02:05:09 · 169 阅读 · 0 评论 -
415.字符串相加
Given two non-negative integers, num1 and num2 represented as string, return the sum of num1 and num2 as a string.You must solve the problem without using any built-in library for handling large integers (such as BigInteger). You must also not convert the原创 2021-08-20 01:29:18 · 93 阅读 · 0 评论 -
238.除自身以外数组的乘积
Product of Array Except SelfGiven an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer..原创 2021-08-20 01:25:53 · 119 阅读 · 0 评论 -
409.最长回文串
Given a string s which consists of lowercase or uppercase letters, return the length of the longest palindrome that can be built with those letters.Letters are case sensitive, for example, “Aa” is not considered a palindrome here.Example 1:Input: s = “a原创 2021-08-20 01:22:38 · 86 阅读 · 0 评论 -
290.单词规律
Given a pattern and a string s, find if s follows the same pattern.Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in s.Example 1:Input: pattern = “abba”, s = “dog cat cat dog”Output: true原创 2021-08-20 01:18:33 · 136 阅读 · 1 评论