leetcode练习
文章平均质量分 54
小心眼YUAN
这个作者很懒,什么都没留下…
展开
-
LeetCode oj 21. Merge Two Sorted Lists(分类:链表)(难度:easy)
21. Merge Two Sorted ListsMerge 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.思路:利用尾插法:s-next=tail-ne原创 2017-08-01 18:49:36 · 201 阅读 · 0 评论 -
leetcode 8. String to Integer (atoi)
题目:8. String to Integer (atoi)Medium8685565FavoriteShareImplement atoi whichconverts a string to an integer.The function first discards as many whitespace characters as necessary until the ...原创 2019-04-08 11:33:05 · 85 阅读 · 0 评论 -
leetcode 29. Divide Two Integers
题目Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator.Return the quotient after dividing dividend by divisor.The integer division...原创 2019-04-11 11:09:46 · 96 阅读 · 0 评论 -
leetcode 12. Integer to Roman
题目:Roman numerals are represented by seven different symbols:I, V, X, L, C, D and M.Symbol ValueI 1V 5X 10L 50C 100D ...原创 2019-04-10 21:25:04 · 79 阅读 · 0 评论 -
leetcode 90. Subsets II
题目:Given a collection of integers that might contain duplicates, nums, return all possible subsets (the power set).Note: The solution set must not contain duplicate subsets.Example:Input: [1,...原创 2019-03-26 21:26:09 · 62 阅读 · 0 评论 -
leetcode 7. Reverse Integer
题目:Given a 32-bit signed integer, reverse digits of an integer.Example 1:Input: 123Output: 321Example 2:Input: -123Output: -321Example 3:Input: 120Output: 21Note:Assume we are...原创 2019-04-04 15:22:31 · 109 阅读 · 0 评论 -
leetcode 94. Binary Tree Inorder Traversal
题目:Given a binary tree, return the inorder traversal of its nodes' values.Example:Input: [1,null,2,3] 1 \ 2 / 3Output: [1,3,2]Follow up: Recursive solution is trivial, co...原创 2019-04-04 14:09:54 · 69 阅读 · 0 评论 -
leectcode 75.Sort Colors
题目Given an array with n objects colored red, white or blue, sort them in-placeso that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use th...原创 2019-03-25 13:46:33 · 89 阅读 · 0 评论 -
leetcode 95. Unique Binary Search Trees
题目Given n, how many structurally unique BST's (binary search trees) that store values 1 ...n?分析:这个题的思想和《算法导论》上的“矩阵链乘法”和“钢条割据问题”非常类似!代码一:100.00% 5.38%自底而上的动态规划。class Solution {public: ...原创 2019-03-21 10:24:36 · 46 阅读 · 0 评论 -
leetcode 10. Regular Expression Matching(动态规划)
题目Given an input string (s) and a pattern (p), implement regular expression matching with support for '.' and '*'.'.' Matches any single character.'*' Matches zero or more of the preceding el...原创 2019-03-19 18:06:46 · 157 阅读 · 0 评论 -
leetcode刷题计划(一)(11.19-11.25)
目录 4. Median of Two Sorted Arrays128. Longest Consecutive Sequence 1. Two Sum15. 3Sum16. 3Sum Closest4. Median of Two Sorted ArraysThere are two sorted arrays nums1 and nums2 of size ...原创 2018-11-22 14:34:41 · 321 阅读 · 0 评论 -
26. Remove Duplicates from Sorted Array
class Solution {public: int removeDuplicates(vector<int>& nums) { //O(n),O(1) //(1)做好空数组判断 if(nums.empty()) return 0; int index=0; for(int i=1...原创 2018-05-31 16:23:25 · 58 阅读 · 0 评论 -
LeetCode oj 83. Remove Duplicates from Sorted List(分类:链表)(难度:easy)
83. Remove Duplicates from Sorted ListGiven a sorted linked list, delete all duplicates such that each element appear onlyonce.For example,Given 1->1->2, return 1->2.Given 1->1->2->3->3, retur原创 2017-08-01 19:00:14 · 188 阅读 · 0 评论 -
leetcode 50. Pow(x, n)
题目:Implement pow(x, n), which calculatesx raised to the power n (xn).Example 1:Input: 2.00000, 10Output: 1024.00000Example 2:Input: 2.10000, 3Output: 9.26100Example 3:Input: 2.00...原创 2019-04-12 11:07:07 · 83 阅读 · 0 评论