朝着梦想前行。

写在前面两道类似的题目，解法不一样（哭笑不得.jpg）,一道用slidingwindow解，一道DP。713. Subarray Product Less Than K题目描述Your are given an array of positive integers nums.Count and print the number of (contiguous) subar...

leetcode 236

leetcode 229 Majority Element II

leetcode 667. Beautiful Arrangement II

leetcode 34. search for a range

leetcode 480. Sliding Widow Median

N皇后问题

leetcode 219. Contains Duplicate II

leetcode 354. Russian Doll Envelopes & leetcode 300 Longest Increasing Subsequence

leetcode 330. Patching Array

leetcode 436 find right interval

leetcode 363 Max Sum of Rectangle No Larger Than K

leetcode 650. 2 Keys Keyboard

拓扑排序的DFS解法

leetcode 552. Student Attendance Record II & 600. Non-negative Integers without Consecutive Ones

写在前面好久没写算法题题解了，实在太忙了。每周的contest都有在做，本周的contest 第二题第三题都算比较有趣的题目，也都A了，先整理一下第三题的解题思路。题目描述On a 2x3 board, there are 5 tiles represented by the integers 1 through 5, and an empty square represented b

leetcode 486

leetcode 343. Integer Break

leetcode 23. Merge K Sorted Lists

leetcode 653. Two Sum IV - Input is a BST

leetcode 540. Single Element in a Sorted Array

leetcode 406. Queue Reconstruction by Height

contest 49 LIS

leetcode 666 contest 43

leetcode 316 remove duplicate letters

leetcode 684. Redundant Connection

leetcode 25. Reverse Nodes in k-Group

leetcode 131 palindrome partitioning

leetcode 560. Subarray Sum Equals K & leetcode 1. Two Sum

leetcode 328 odd even linked list

leetcode 516 longest palindromic subsequence

leetcode 318 maximum product of word lengths

这道题的题目描述就跟标题一样了，一个经典问题，基本可以默写出来了，很简单。头插法要创建额外O（n）空间，这里不介绍。 具体代码如下，因为使用了auto，需要在支持C++11的编译器中运行：ListNode* reverseList(ListNode* head) { typedef ListNode* Node; if(head==nullptr) r

leetcode 378 Kth Smallest Element in a Sorted Matrix

leetcode 494 target sum

之所以这两题放在一起整理，是觉得两道题目很相近，基本思路一样，而且都是跟时间表示相关的类型。leetcode 539. Minimum Time Difference题目描述：Given a list of 24-hour clock time points in “Hour:Minutes” format, find the minimum minutes difference between a

题目描述A magical string S consists of only ‘1’ and ‘2’ and obeys the following rules: The string S is magical because concatenating the number of contiguous occurrences of characters ‘1’ and ‘2’ generate

题目描述:Given four lists A, B, C, D of integer values, compute how many tuples (i, j, k, l) there are such that A[i] + B[j] + C[k] + D[l] is zero.To make problem a bit easier, all A, B, C, D have same len

题目描述： Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element

The Hamming distance between two integers is the number of positions at which the corresponding bits are different. Now your job is to find the total Hamming distance between all pairs of the given nu