majinliang1234的博客

题目： 733. Flood Fill(https://leetcode.com/problems/flood-fill/description/)解法1：将符合条件的坐标放在一个队列里面，每次取一个（取完就在队列中移除），然后检查该坐标上下左右四个点中符合要求的坐标放进队列里，直到队列为空为止。class Solution { public int[][] floodFill...

题目: 767 Reorganize String (https://leetcode.com/problems/reorganize-string/)每次取当前出现频率最高的两个字母拼接在字符串上。直到PriorityQueue中元素的数量只有一个或者没有。如果只有一个且他还有大于1的频率，就说明这个字符创无法Reorganize。class Solution { public...

题目：894. All Possible Full Binary Trees(https://leetcode.com/problems/all-possible-full-binary-trees/description/).这个问题是典型的递归问题，首先读题之后可知有性质“完全二叉树结点个数必定为奇数”。所以问题变简单了点，如果输入N为偶数，直接输出空List即可。对于一个有n个结点的...

题目： 436. Find Right Interval(https://leetcode.com/problems/find-right-interval/description/)public class Solution { public int[] findRightInterval(Interval[] intervals) { NavigableMap<I...

题目： LeetCode: 392. Is Subsequence(https://leetcode.com/problems/is-subsequence/description/)class Solution { public boolean isSubsequence(String s, String t) { int currentLoc = 0; byte[] byte...

题目： LeetCode: 792. Number of Matching Subsequences(https://leetcode.com/problems/number-of-matching-subsequences/description/) class Solution { public int numMatchingSubseq(String S, String[]...

题目： 210. Course Schedule II(https://leetcode.com/problems/course-schedule-ii/description/)public class Solution { public int[] findOrder(int numCourses, int[][] prerequisites) { if (numCourses ...

题目：592. Fraction Addition and Subtraction(https://leetcode.com/problems/fraction-addition-and-subtraction/description/)解法：首先对字符串进行拆分，组成一个个分数，然后分数通分相加，最后约分。import java.util.ArrayList;import java....

题目：890. Find and Replace Pattern(https://leetcode.com/problems/find-and-replace-pattern/description/)解法：将元素的出现的位置放入数组中，当元素第一次出现时，他在数组中的值是默认值0，当相同的再次元素出现时，它在数组中的值应该相同，否则说明不匹配。class Solution { p...

题目：74. Search a 2D Matrix(https://leetcode.com/problems/search-a-2d-matrix/description/)解法：将二维数组看成一维数组，元素的坐标可以计算出来。此解法使用二分查找。public class Solution { public boolean searchMatrix(int[][] matrix...

题目：341. Flatten Nested List Iterator(https://leetcode.com/problems/flatten-nested-list-iterator/description/)解法：使用DFS先将所有的Integer存到一个List中，然后使用这个List的Iterator。public class NestedIterator implem...

题目: 23. Merge k Sorted Lists(https://leetcode.com/problems/merge-k-sorted-lists/description/)class Solution { public ListNode mergeKLists(ListNode[] lists) { ListNode result = null, tai...