LeetCode 刷题笔记
文章平均质量分 59
EOLIFE
秃秃秃
展开
-
LeetCode 879 Profitable Schemes
There is a group of n members, and a list of various crimes they could commit. The ith crime generates a profit[i] and requires group[i] members to participate in it. If a member participates in one crime, that member can’t participate in another crime. Le原创 2021-03-13 15:23:03 · 132 阅读 · 0 评论 -
04: Median of Two Sorted Arrays
Median of Two Sorted Arrays Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. Example 1: Input: nums1 = [1,3], nums2 = [2] Output: 2.00000 Explanation: merged array = [1,2,3] and median is原创 2021-03-04 15:17:41 · 125 阅读 · 1 评论 -
LeetCode 3 Longest Substring Without Repeating Characters
Given a string s, find the length of the longest substring without repeating characters. Example 1: Input: s = "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3. Example 2: Input: s = "bbbbb" Output: 1 Explanation: The answe原创 2021-03-02 23:39:31 · 94 阅读 · 0 评论 -
LeetCode 15. 3Sum
class Solution { public List<List<Integer>> threeSum(int[] nums) { ArrayList<List<Integer>> res = new ArrayList<>(); sort(nums); for(int i = 0...原创 2020-02-18 14:17:35 · 99 阅读 · 0 评论 -
LeetCode 4.寻找两个有序数组的中位数
aaa原创 2020-02-11 16:19:27 · 94 阅读 · 0 评论 -
LeetCode 02.Add Two Numbers
#include <stdio.h> #include <malloc.h> #include <stdlib.h> typedef struct Node { int data; Node *next; }ListNode, *List; List Convert(int a) { ListNode *p, *tail; L...原创 2020-02-10 12:42:31 · 83 阅读 · 0 评论