leetcode_效率题解_python & C++
文章平均质量分 64
Mosen_Huang
to be 鱼叔
展开
-
leetcode_53 Maximum Subarray_动态规划
题目链接 题意: Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2,1,−5,4], the contiguous subarray [4,−1原创 2016-10-12 16:37:48 · 742 阅读 · 0 评论 -
leetcode_[python/C++逐步深入]_217. Contains Duplicate(深度分析位操作算法)
题目链接 【题目】 Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every原创 2016-11-16 14:23:56 · 549 阅读 · 0 评论 -
leetcode_[python/C++]_121/122/123/188.Best Time to Buy and Sell Stock I/II/III/IV
121. Best Time to Buy and Sell Stock [题目] Say you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, bu原创 2016-11-21 20:49:06 · 526 阅读 · 0 评论 -
leetcode_326. Power of Three分析
类似的题解详见: leetcode_232. Power of Two分析 leetcode_342. Power of Four分析 题目链接 【题目】 Given an integer, write a function to determine if it is a power of three. 【分析】 解法1: 一般做法class Solution {public:原创 2016-11-22 11:49:35 · 658 阅读 · 0 评论 -
leetcode_232. Power of Two分析
类似的题解详见: power of 3 power of 4题目链接 【题目】 Given an integer, write a function to determine if it is a power of two. 【分析】 解法1: 令temp=1,然后temp *= 2, 判断temp == n ?class Solution {public: bool isP原创 2016-11-22 11:23:59 · 400 阅读 · 0 评论 -
leetcode_342. Power of Four分析
类似的题解详见: leetcode_232. Power of Two分析 leetcode_326. Power of Three分析 题目链接 【题目】 Given an integer (signed 32 bits), write a function to check whether it is a power of 4.Example: Given num = 16, ret原创 2016-11-22 11:59:06 · 384 阅读 · 0 评论 -
leetcode_75. Sort Colors题解
题目链接 【题目】 Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the in原创 2016-11-22 21:00:54 · 436 阅读 · 0 评论 -
leetcode_88. Merge Sorted Array
题目链接 【题目】 Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.class Solution {public: void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {原创 2016-11-22 21:51:14 · 387 阅读 · 0 评论 -
leetcode_效率题解_23. Merge k Sorted Lists(合并k个有序链表)
相关题解: leetcode_效率题解_[python/C++]_21. Merge Two Sorted Lists(合并2个有序链表)题目链接 【题目】 Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 【分析】 想到从第一个链表到最后原创 2016-11-22 22:09:45 · 632 阅读 · 0 评论 -
leetcode_效率题解_[python/C++]_21. Merge Two Sorted Lists(合并2个有序链表)
相关题解: leetcode_效率题解_23. Merge k Sorted Lists(合并k个有序链表)题目链接 【题目】 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原创 2016-11-22 21:58:28 · 2527 阅读 · 0 评论 -
leetcode_效率题解_[python/C++]_147. Insertion Sort List(链表插入排序)
相关题解: leetcode_效率题解148. Sort List(链表归并排序)题目链接 【题目】 Sort a linked list using insertion sort.【分析】 首先复习一下插入排序:void insert_sort( int a[] , int n ){ int i,j,temp; for( i = 1; i < n; i ++ ){原创 2016-11-22 21:23:15 · 749 阅读 · 0 评论 -
leetcode_效率题解_148. Sort List_(链表归并排序)
相关题解: leetcode_效率题解_[python/C++]_147. Insertion Sort List(链表插入排序)题目链接 【题目】 Sort a linked list in O(n log n) time using constant space complexity. 【分析】 O(nlogn)的复杂度我们很显然想到归并排序,快速排序记得大一的时候写链表排序的题都原创 2016-11-22 21:38:07 · 562 阅读 · 0 评论 -
leetcode_50. Pow(x, n)
题目链接【题目】 Implement pow(x, n). 【分析】 举例说明: N = 9 = 2^3 + 2^0 = 1001 二进制 x^9 = x^(2^3) * x^(2^0) 所以其实就是二进制位为1时乘以对应的2的乘方class Solution {public: double myPow(double x, int n) { long num =原创 2016-11-22 23:00:33 · 464 阅读 · 0 评论 -
leetcode题解分析_84. Largest Rectangle in Histogram
【题目】题目链接 Given n non-negative integers representing the histogram’s bar height where the width of each bar is 1, find the area of largest rectangle in the histogram. Above is a histogram where width原创 2016-11-25 15:04:02 · 583 阅读 · 0 评论 -
leetcode题解分析_223. Rectangle Area
【题目】题目链接 Find the total area covered by two rectilinear rectangles in a 2D plane.Each rectangle is defined by its bottom left corner and top right corner as shown in the figure . Assume that the tot原创 2016-11-25 15:34:09 · 549 阅读 · 0 评论 -
leetcode题解分析_221. Maximal Square(图文分析)
【题目】题目链接 Given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s and return its area.For example, given the following matrix:1 0 1 0 0 1 0 1 1 1 1 1 1 1 1 1 0原创 2016-11-25 16:11:08 · 746 阅读 · 0 评论 -
leetcode_[python/C++逐步深入] 43. Multiply Strings_(大数乘法分析)
题目链接 【题目】 Given two numbers represented as strings, return multiplication of the numbers as a string.Note: The numbers can be arbitrarily large and are non-negative. Converting the input string to原创 2016-11-17 00:32:37 · 609 阅读 · 1 评论 -
leetcode_[python/C++]_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. 【分析】 做法(1):可以在new_list前先加一个无关的节点然后返回new_list-原创 2016-11-20 20:42:51 · 398 阅读 · 0 评论 -
leetcode_120 Triangle_动态规划
题目链接 题意:Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below.For example, given the following triangle[ [2], [3,4], [6原创 2016-10-11 22:16:00 · 479 阅读 · 0 评论 -
leetcode_127_Word Ladder_BFS
题目链接 Given two words (beginWord and endWord), and a dictionary’s word list, find the length of shortest transformation sequence from beginWord to endWord, such that:Only one letter can be changed at a原创 2016-10-13 12:27:08 · 556 阅读 · 0 评论 -
leetcode_[python/C++] 329. Longest Increasing Path in a Matrix(DFS+记忆化搜索)
题目链接 【题目】 Given an integer matrix, find the length of the longest increasing path.From each cell, you can either move to four directions: left, right, up or down. You may NOT move diagonally or move原创 2016-11-16 01:15:46 · 351 阅读 · 0 评论 -
leetcode_[python/C++]_395_Longest Substring with At Least K Repeating Characters_(递归非递归)
题目链接【题目】 Find the length of the longest substring T of a given string (consists of lowercase letters only) such that every character in T appears no less than k times.Example 1:Input: s = “aaabb”, k原创 2016-11-13 11:35:54 · 380 阅读 · 0 评论 -
leetcode_[python/C++]_395_Longest Substring with At Least K Repeating Characters
题目链接【题目】Find the length of the longest substring T of a given string (consists of lowercase letters only) such that every character in T appears no less than k times.Example 1:Input:s原创 2016-11-13 11:05:59 · 293 阅读 · 0 评论 -
leetcode_[python/C++]_424_Longest Repeating Character Replacement
题目链接 【题目】 Given a string that consists of only uppercase English letters, you can replace any letter in the string with another letter at most k times. Find the length of a longest substring containi原创 2016-11-12 21:30:11 · 362 阅读 · 0 评论 -
leetcode_[python/java/javascript/C++]_401_Binary Watch(二进制手表)
题目链接 【题目】 A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent the minutes (0-59). Each LED represents a zero or one, with the least signifi原创 2016-11-11 14:34:01 · 773 阅读 · 0 评论 -
leetcode_[Python/C++]_3_Longest Substring Without Repeating Characters(不重复子串最大长度)
题目链接 【题意】 给定一个字符串,找到其中的一个最长的字串,使得这个子串不包含重复的字符 【分析】 题目很简单,第一眼想到的是动态规划,另外主要是为了分享一些做法写法C++class Solution {public: int lengthOfLongestSubstring(string s) { if(s.size()==0) return 0;原创 2016-11-11 14:10:53 · 317 阅读 · 0 评论 -
leetcode_[python/C++]_97_Interleaving String_动态规划
题目链接 【题目】 Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example, Given: s1 = “aabcc”, s2 = “dbbca”,When s3 = “aadbbcbcac”, return true. When s3 = “aadbbbaccc”,原创 2016-11-09 18:01:03 · 401 阅读 · 0 评论 -
leetcode_[python/C++]_91_Decode Ways_动态规划
题目链接 【题目】 A message containing letters from A-Z is being encoded to numbers using the following mapping: ‘A’ -> 1 ‘B’ -> 2 … ‘Z’ -> 26 Given an encoded message containing digits, determine the t原创 2016-11-09 17:48:45 · 296 阅读 · 0 评论 -
leetcode_[python/C++]_98_Validate Binary Search Tree
题目链接 【题目】Given a binary tree, determine if it is a valid binary search tree (BST).Assume a BST is defined as follows:The left subtree of a node contains only nodes with keys less than the node’s key.原创 2016-11-09 17:27:32 · 303 阅读 · 0 评论 -
leetcode_[python/C++]_300_Longest Increasing Subsequence
题目链接 【题目】 Given an unsorted array of integers, find the length of longest increasing subsequence.For example Given [10, 9, 2, 5, 3, 7, 101, 18], The longest increasing subsequence is [2, 3, 7, 101]原创 2016-11-13 17:31:15 · 315 阅读 · 0 评论 -
leetcode_[python/C++] 17.Letter Combinations of a Phone Number(手机号码字符组合)
题目链接 【题目】 Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below. Input:Digit原创 2016-11-15 17:40:45 · 524 阅读 · 0 评论 -
leetcode_[python/C++] 179. Largest Number(数字组合成最大数)
题目链接 【题目】 Given a list of non negative integers, arrange them such that they form the largest number.For example, given [3, 30, 34, 5, 9], the largest formed number is 9534330.Note: The result may be原创 2016-11-15 18:06:05 · 1505 阅读 · 0 评论 -
leetcode_[python/C++]_19. Remove Nth Node From End of List(删除链表末第n个节点)
题目链接 【题目】 Given a linked list, remove the nth node from the end of list and return its head.For example,Given linked list: 1->2->3->4->5, and n = 2.After removing the second node from the end, the li原创 2016-11-20 17:43:42 · 478 阅读 · 0 评论 -
leetcode题解分析_85. Maximal Rectangle
【题目】题目链接 Given a 2D binary matrix filled with 0’s and 1’s, find the largest rectangle containing only 1’s and return its area.For example, given the following matrix:1 0 1 0 0 1 0 1 1 1 1 1 1 1 1 1原创 2016-11-25 15:25:43 · 742 阅读 · 0 评论