leetcode
文章平均质量分 65
同销万古愁
原博客地址:http://www.cnblogs.com/mafang/
因后台编辑界面太不友好换到csdn
展开
-
185. Department Top Three Salaries
Table:Employee+--------------+---------+| Column Name | Type |+--------------+---------+| id | int || name | varchar || salary | int || departmentId | int |+--------------+---------+id is the primary key .原创 2022-01-21 10:39:40 · 233 阅读 · 0 评论 -
24. Swap Nodes in Pairs
Given alinked list, swap every two adjacent nodes and return its head. You must solve the problem withoutmodifying the values in the list's nodes (i.e., only nodes themselves may be changed.)Example 1:Input: head = [1,2,3,4]Output: [2,1,4,3]..原创 2021-08-24 13:20:22 · 153 阅读 · 0 评论 -
22. Generate Parentheses*
题目:Givennpairs of parentheses, write a function togenerate all combinations of well-formed parentheses.Example 1:Input: n = 3Output: ["((()))","(()())","(())()","()(())","()()()"]Example 2:Input: n = 1Output: ["()"]Constraints:1 ...原创 2021-08-24 11:24:33 · 173 阅读 · 0 评论 -
17. Letter Combinations of a Phone Number
题目:Given a string containing digits from2-9inclusive, return all possible letter combinations that the number could represent. Return the answer inany order.A mapping of digit to letters (just like on the telephone buttons) is given below. Note that...原创 2021-06-09 14:46:56 · 102 阅读 · 0 评论 -
15. 3Sum & 16. 3Sum Closest
这两个题非常相似,所以放在一起了题目Given an integer array nums, return all the triplets[nums[i], nums[j], nums[k]]such thati != j,i != k, andj != k, andnums[i] + nums[j] + nums[k] == 0.Notice that the solution set must not contain duplicate triplets.Exampl...原创 2021-06-09 11:55:45 · 87 阅读 · 0 评论 -
12. Integer to Roman
题目:Roman numerals are represented by seven different symbols:I,V,X,L,C,DandM.Symbol ValueI 1V 5X 10L 50C 100D 500M 1000For example,2is written...原创 2021-06-06 15:55:20 · 100 阅读 · 0 评论 -
11. Container With Most Water
题目:Givennnon-negative integersa1, a2, ..., an, where each represents a point at coordinate(i, ai).nvertical lines are drawn such that the two endpoints of the lineiis at(i, ai)and(i, 0). Find two lines, which, together with the x-axis forms a...原创 2021-06-06 11:44:38 · 137 阅读 · 0 评论 -
42. Trapping Rain Water
题目解法class Solution {public: int trap(int A[], int n) { int left=0; int right=n-1; int res=0; int maxleft=0, maxright=0; while(left<=right){ if(A[left]<=A[right]){ if(A[left]>.原创 2021-06-01 09:48:32 · 98 阅读 · 0 评论 -
5. Longest Palindromic Substring
题目Example 1:Input: s = "babad"Output: "bab"Note: "aba" is also a valid answer.Example 2:Input: s = "cbbd"Output: "bb"Example 3:Input: s = "a"Output: "a"Example 4:Input: s = "ac"Output: "a"Constraints:1 <= s.length <.原创 2021-05-31 15:27:24 · 77 阅读 · 0 评论 -
258. Add Digits
题目Given an integernum, repeatedly add all its digits until the result has only one digit, and return it.Example 1:Input: num = 38Output: 2Explanation: The process is38 --> 3 + 8 --> 1111 --> 1 + 1 --> 2 Since 2 has only one digi..原创 2021-05-27 19:46:43 · 56 阅读 · 0 评论 -
43. Multiply Strings
题目:Given two non-negative integersnum1andnum2represented as strings, return the product ofnum1andnum2, also represented as a string.Note:You must not use any built-in BigInteger library or convert the inputs to integer directly.Example 1:...原创 2021-05-25 10:57:24 · 145 阅读 · 0 评论 -
8. String to Integer (atoi)
目录题目知识点解法一:解法二:题目Implement themyAtoi(string s)function, which converts a string to a 32-bit signed integer (similar to C/C++'satoifunction).The algorithm formyAtoi(string s)is as follows:Read in and ignore any leading whitespace. ...原创 2021-05-21 13:55:52 · 193 阅读 · 0 评论 -
6. ZigZag Conversion
题目:The string"PAYPALISHIRING"is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S I I GY I RAnd then read line by line:"PAHNAPL...原创 2021-04-28 15:47:34 · 113 阅读 · 0 评论 -
452. Minimum Number of Arrows to Burst Balloons
452.Minimum Number of Arrows to Burst Balloons题目:There are some spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it's horizontal, y-coordinates don'.原创 2021-04-28 09:22:39 · 88 阅读 · 0 评论 -
435. Non-overlapping Intervals
题目Given an array of intervalsintervalswhereintervals[i] = [starti, endi], returnthe minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.Example 1:Input: intervals = [[1,2],[2,3],[3,4],[1,3]]Output...原创 2021-04-27 16:50:02 · 106 阅读 · 0 评论 -
56. Merge Intervals
题目Given an arrayofintervalswhereintervals[i] = [starti, endi], merge all overlapping intervals, and returnan array of the non-overlapping intervals that cover all the intervals in the input.Example 1:Input: intervals = [[1,3],[2,6],[8,10],[1...原创 2021-04-26 22:07:01 · 138 阅读 · 0 评论 -
876Middle of the Linked List
目录题目知识点解法题目Given a non-empty, singlylinked list with head nodehead, returnamiddle node of linked list.If there are two middle nodes, return the second middle node.Example 1:Input: [1,2,3,4,5]Output: Node 3 from this list (Serial...原创 2021-04-24 10:45:37 · 148 阅读 · 0 评论 -
19Remove Nth Node From End of List
题目Given theheadof a linked list, remove thenthnode from the end of the list and return its head.Follow up:Could you do this in one pass?Example 1:Input: head = [1,2,3,4,5], n = 2Output: [1,2,3,5]Example 2:Input: head = [1], n = 1Out...原创 2021-04-24 09:07:18 · 67 阅读 · 0 评论 -
387. First Unique Character in a String
题目Given a strings, returnthe first non-repeating character in it and return its index. If it does not exist, return-1.Example 1:Input: s = "leetcode"Output: 0Example 2:Input: s = "loveleetcode"Output: 2Example 3:Input: s = "aabb"Ou...原创 2021-04-23 16:22:22 · 133 阅读 · 1 评论 -
190. Reverse Bits
题目Reverse bits of a given 32 bits unsigned integer.Note:Note that in some languages such as Java, there is no unsigned integer type. In this case, both input and output will be given as a signed integer type. They should not affect your implementatio原创 2021-04-21 10:15:13 · 53 阅读 · 0 评论 -
SQL 177. Nth Highest Salary
这个和之前找第2高的薪水,解决办法很像。需要注意的是需要提前计算N-1,因为limit里不能识别包含算数运算的表达式而且在函数里,不用加@表示变量。。。CREATE FUNCTION getNthHighestSalary(N INT) RETURNS INTBEGINdeclare nth int;set nth = N-1; RETURN ( # Write your MySQL query statement below. select distinct原创 2020-11-13 14:19:17 · 116 阅读 · 0 评论 -
SQL 176. Second Highest Salary
目录总结题目解法一解法二rank解法(wrong)总结找第二高的薪水,没有第二高的薪水时,返回null。我用了rank()函数,但是当没有第二高的薪水时,返回的是空,不符合要求。看了下解决方案,个人感觉最好的是用limit或limit+offset来做limit n,m,意为跳过开头的n位,从第n+1位开始取,一共取m个。limit n offset m,意为跳过开头的m位,从第m+1开始取,一共取n个。题目Write a SQL query to ge.原创 2020-11-09 10:51:34 · 246 阅读 · 0 评论 -
1154. Day of the Year
下午有点感冒,挑了个简单的题刷来打发时间,然后被大神教做人题目:Given a stringdaterepresenting aGregoriancalendardate formatted asYYYY-MM-DD, return the day number of the year.Example 1:Input: date = "2019-01-09"O...原创 2019-12-06 10:25:30 · 301 阅读 · 0 评论 -
283. Move Zeroes
目录题目描述高票解法我的解法分析比较题目描述Given an arraynums, write a function to move all0's to the end of it while maintaining the relative order of the non-zero elements.Example:Input: [0,1,0,3,1...原创 2019-12-03 09:57:00 · 103 阅读 · 0 评论 -
14. Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.写一个函数在字符串数组中找到最长公共子字符串高票答案,利用了indexof查找子字符串功能~public String longestCommonPrefix(String[] strs) { if(strs...原创 2018-03-13 10:26:00 · 107 阅读 · 0 评论 -
20. Valid Parentheses
Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all valid bu...原创 2018-03-18 21:19:00 · 124 阅读 · 0 评论 -
21. Merge Two Sorted Lists
题目:将两个有序链表合并为一个新链表。该新链表必须是之前两个链表的节点合并而成。Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.Example:Inpu...原创 2018-03-26 10:06:00 · 82 阅读 · 0 评论 -
58. Length of Last Word
给定一个包含大写/小写字母和空格字符' '的字符串,返回字符串中最后一个单词的长度。如果最后一个单词不存在,返回0.(自己理解有误,认为如"a "这样即最后一个单词不存在,实际并不是,对该字符串来说,最后一个单词是a,长度为1)注意:一个单词被定义为由不为空的字符组成的序列,即不包含' '.Given a string s consists of upper/lower-case a...原创 2018-03-26 10:34:00 · 103 阅读 · 0 评论 -
67. Add Binary
给定两个二进制字符串,返回它们的和(也是一个二进制字符串)Given two binary strings, return their sum (also a binary string).For example,a = "11"b = "1"Return "100". lx223的解法public class Solution { public String ...原创 2018-03-26 15:46:00 · 82 阅读 · 0 评论 -
69. Sqrt(x)(数学、二分法)
实现针对int类型的sqrt(int x)。计算并返回x的平方根,x确定为非负整数Implement int sqrt(int x).Compute and return the square root of x.x is guaranteed to be a non-negative integer. Example 1:Input: 4Output: 2 ...原创 2018-03-30 13:48:00 · 205 阅读 · 0 评论 -
83.Remove Duplicates from Sorted List
Given a sorted linked list, delete all duplicates such that each element appear only once.给定一个有序数组,删除其中所有重复的元素,使每个元素只出现一次~For example,Given 1->1->2, return 1->2.Given 1->1->2->...原创 2018-03-30 15:31:00 · 78 阅读 · 0 评论 -
110. Balanced Binary Tree(五星,二叉树)
这个题简直了,不知道我是浮躁还是太累,错了四次。。。。。给定二叉树,决定它是否高度平衡。在该问题中,高度平衡的二叉树是指任何节点的两个子树深度差不超过1.Example 1:Given the following tree [3,9,20,null,null,15,7]: 3 / \ 9 20 / \ 15 7Return true.Example 2:Giv...原创 2018-05-07 19:15:47 · 88 阅读 · 0 评论 -
38. Count and Say
题目:The count-and-say sequence is the sequence of integers with the first five terms as following:1. 12. 113. 214. 12115. 1112211 is read off as "one 1" or 11.11 is read...原创 2018-03-11 22:00:00 · 251 阅读 · 0 评论 -
2. Add Two Numbers
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return i...原创 2018-04-03 17:13:00 · 80 阅读 · 0 评论 -
155. Min Stack
题目:Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.push(x) -- Push element x onto stack. pop() -- Removes the element on top of the stack. top() ...原创 2019-01-24 13:49:33 · 123 阅读 · 0 评论 -
344. Reverse String
目录我的解法高票C++解法高票java 解法Write a function that reverses a string. The input string is given as an array of characters char[].Do not allocate extra space for another array, you must do this by m...原创 2019-01-31 14:53:55 · 297 阅读 · 0 评论 -
326. Power of Three
目录我的解法高票O(1)解法Given an integer, write a function to determine if it is a power of three.Example 1:Input: 27Output: trueExample 2:Input: 0Output: falseExample 3:Input: 9Output:...原创 2019-01-31 15:26:14 · 189 阅读 · 0 评论 -
458. Poor Pigs
There are 1000 buckets, one and only one of them contains poison, the rest are filled with water. They all look the same. If a pig drinks that poison it will die within 15 minutes. What is the minimum...原创 2019-02-02 13:49:43 · 268 阅读 · 0 评论 -
349. Intersection of Two Arrays(c++)
给两个数组,写一个函数来计算这两个数组的交集。Example 1:Input: nums1 = [1,2,2,1], nums2 = [2,2]Output: [2]Example 2:Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]Output: [9,4]注意:结果中的元素没有重复 结果的顺序无所谓class Solu...原创 2019-01-29 09:22:35 · 177 阅读 · 0 评论 -
977. Squares of a Sorted Array
Given an array of integers A sorted in non-decreasing order, return an array of the squares of each number, also in sorted non-decreasing order.Example 1:Input: [-4,-1,0,3,10]Output: [0,1,9,16,1...原创 2019-02-04 12:32:36 · 358 阅读 · 0 评论