c++
MJ-GOD
拥有梦与想
展开
-
Leetcode: 240. Search a 2D Matrix II (week2 --- medium)
题目题意题解最简单(实现最简单)的方法 复杂度:O()找特殊位置元素法 复杂度:O(n+m)归并方法 总结 题目Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Intege...原创 2018-09-12 21:47:20 · 301 阅读 · 0 评论 -
Leetcode: 322. Coin Change (week13---medium)
题目 322. Coin ChangeYou are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount. ...原创 2018-12-02 22:50:31 · 120 阅读 · 0 评论 -
Leetcode: 115. Distinct Subsequences (week12---hard)
115. Distinct Subsequences题目实例 分析题解115. Distinct Subsequences题目Given a string S and a string T, count the number of distinct subsequences of S which equals T.A subsequence of a string...原创 2018-11-20 23:52:07 · 259 阅读 · 0 评论 -
Leetcode: Triangle、Interleaving String (week11---hard×1, medium×1)
120. Triangle题目 分析题解97. Interleaving String 题目分析题解错解(复杂度较高)正解120. Triangle题目 Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent...原创 2018-11-14 10:24:55 · 300 阅读 · 0 评论 -
Leetcode: 10. Regular Expression Matching(week9—hard)
题目实例分析题解错误的解 正确的方法题目Given an input string (s) and a pattern (p), implement regular expression matching with support for '.' and '*'.'.' Matches any single character.'*' Matches zero...原创 2018-11-04 00:14:44 · 267 阅读 · 0 评论 -
Leetcode: Edit Distance、(week10---hard×1, medium×2)
72. Edit Distance题目分析题解63. Unique Paths II题目分析题解64. Minimum Path Sum题目分析题解 72. Edit Distance题目Given two words word1 and word2, find the minimum number of operations requir...原创 2018-11-07 01:09:54 · 259 阅读 · 0 评论 -
Leecode:6. ZigZag Conversion(week8—-medium)
题目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)And then read line ...原创 2018-10-22 00:01:57 · 142 阅读 · 0 评论 -
Leecode:135. Candy(week7—-hard)
题目示例分析题解其他算法改进空间复杂度为O(1),时间复杂度O(n)的算法小结参考题目There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to t...原创 2018-10-17 10:42:07 · 331 阅读 · 0 评论 -
Leetcode: 200. Number of Islands (week4 --- medium)
题目示例分析题解总结题目Given a 2d grid map of '1's (land) and '0's (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or v...原创 2018-09-29 19:01:46 · 280 阅读 · 0 评论 -
Leetcode310. Minimum Height Trees (week5 — medium)
题目示例 分析题解 后记题目For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with mi...原创 2018-10-07 00:21:20 · 323 阅读 · 0 评论 -
Leetcode: 207. Course Schedule(week6 — medium)
题目There are a total of n courses you have to take, labeled from 0 to n-1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a...原创 2018-10-12 23:56:41 · 164 阅读 · 0 评论 -
Leetcode: 113. Path Sum II (week3 --- medium)
题目 题解总结题目 Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.Note: A leaf is a node with no children.题目给出了一个例子: 所以也就是相当于寻找一条从根root开...原创 2018-09-22 20:31:53 · 244 阅读 · 0 评论 -
Leetcode: 23. Merge k Sorted Lists (week1 --- hard)
Merge k Sorted Lists:Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 题意:把k个已经排好序的队列重新排成一个完整的队列题解:这一道题的含义就跟归并排序的合并步骤一样,也就是有序队列的合并。一开始想直接...原创 2018-09-08 15:31:47 · 157 阅读 · 0 评论 -
Leetcode: 188. Best Time to Buy and Sell Stock IV (week14---hard)
题目分析题解附题目Say you have an array for which the ith element is the price of a given stock on day i.Design an algorithm to find the maximum profit. You may complete at most k transactions.N...原创 2018-12-09 20:49:11 · 250 阅读 · 0 评论