Leetcode
ch3ung777
nlp在读硕士,主要研究方向为事件抽取
展开
-
Leetcode | Non-overlapping Intervals (无重叠区间)
Description:Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.Example:Input: [[1,2],[2,3],[3,4],[1,3]]Output: 1Explanation: [1,3] can be removed and the rest o原创 2021-02-08 15:38:27 · 180 阅读 · 0 评论 -
Leetcode | Sort Colors (分发饼干)
Description:假设你是一位很棒的家长,想要给你的孩子们一些小饼干。但是,每个孩子最多只能给一块饼干。对每个孩子 i,都有一个胃口值 g[i],这是能让孩子们满足胃口的饼干的最小尺寸;并且每块饼干 j,都有一个尺寸 s[j] 。如果 s[j] >= g[i],我们可以将这个饼干 j 分配给孩子 i ,这个孩子会得到满足。你的目标是尽可能满足越多数量的孩子,并输出这个最大数值。Example:Input: g = [1,2,3], s = [1,1]Output: 1解释:你原创 2021-02-07 13:03:51 · 80 阅读 · 0 评论 -
Leetcode | Sort Colors (颜色分类)
Description:Given a string, sort it in decreasing order based on the frequency of characters.Example:Input: “tree”Output: “eert”Explanation:‘e’ appears twice while ‘r’ and ‘t’ both appear once.So ‘e’ must appear before both ‘r’ and ‘t’. Therefore原创 2021-02-07 11:09:35 · 96 阅读 · 0 评论 -
Leetcode | Sort Characters By Frequency (按照字符出现次数对字符串排序)
Description:Given a string, sort it in decreasing order based on the frequency of characters.Example:Input: “tree”Output: “eert”Explanation:‘e’ appears twice while ‘r’ and ‘t’ both appear once.So ‘e’ must appear before both ‘r’ and ‘t’. Therefore原创 2021-02-06 18:52:33 · 192 阅读 · 0 评论 -
Leetcode | Top K Frequent Elements (前 K 个高频元素)
Description:Given a non-empty array of integers, return the k most frequent elements.Example:Input: [3,2,1,5,6,4] and k = 2Output: 5Input: [3,2,3,1,2,4,5,5,6] and k = 4Output: 4Ideas: Python has lots of library functions, like sort().Sort the原创 2021-02-06 17:19:31 · 207 阅读 · 0 评论 -
Leetcode | Kth Largest Element in an Array (数组中的第K个最大元素)
Description:Given head, the head of a linked list, determine if the linked list has a cycle in it.There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos原创 2021-02-02 21:19:13 · 89 阅读 · 0 评论 -
Leetcode | Linked List Cycle (判断链表是否存在环)
Description:Given head, the head of a linked list, determine if the linked list has a cycle in it.There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos原创 2021-01-31 11:57:40 · 136 阅读 · 1 评论 -
Leetcode | Merge Sorted Array (合并两个有序数组)
Description:Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.The number of elements initialized in nums1 and nums2 are m and n respectively. You may assume that nums1 has a size equal to m + n such that it ha原创 2021-01-31 11:57:30 · 115 阅读 · 0 评论 -
Leetcode | Valid Palindrome II (回文字符串)
Description:Given a non-empty string s, you may delete at most one character. Judge whether you can make it a palindrome.Example:Input: “aba”Output: TrueInput: “abca”Output: TrueExplanation: You could delete the character ‘c’.Ideas:In this c原创 2021-01-29 12:10:38 · 118 阅读 · 0 评论 -
Leetcode | Reverse Vowels of a String (反转字符串中的元音字符)
Description:Write a function that takes a string as input and reverse only the vowels of a string.Attention:Vowels include captial lettersExample:Input: “hello”Output: “holle”Input: “leetcode”Output: “leotcede”Ideas:The first idea in my mind原创 2021-01-29 12:10:20 · 117 阅读 · 0 评论 -
Leetcode | Sum of Square Numbers (两数平方和)
Description:Given a non-negative integer c, decide whether there’re two integers a and b such that a2 + b2 = c.Example:Input: c = 5Output: trueExplanation: 1 * 1 + 2 * 2 = 5Input: c = 3Output: falseIdeas:We all know that the sqrt of an integ原创 2021-01-27 23:24:14 · 180 阅读 · 0 评论 -
Leetcode | Two Sum (两数之和)
Description:Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.You may assume that each input would have exactly one solution, and you may not use the same element twice.You can retu原创 2021-01-27 13:22:47 · 158 阅读 · 2 评论