LeetCode
关注
分享
扫一扫
私念Moposion
这个作者很懒，什么都没留下…
展开
-
392. Is Subsequence(贪心)
package Greedy;public class isSubsequence_392 { public boolean isSubsequence(String s, String t) { if(s.length()==0||s==null) { return true; } int i = 0; int j = 0; for (i = 0; i <...原创 2020-02-14 17:08:30 · 230 阅读 · 1 评论 -
129. Sum Root to Leaf Numbers(深搜、递归)
package Depth_first_Search;public class SumNumbers_129 { public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } } int sum; int total; public ...原创 2020-02-12 13:56:34 · 186 阅读 · 0 评论 -
101. Symmetric Tree(深搜、递归)
package Recursion;public class IsSymmetric_101 { public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } } public boolean isSymmetric(TreeNode ...原创 2020-02-11 21:18:21 · 215 阅读 · 0 评论 -
117. Populating Next Right Pointers in Each Node II(队列、二叉树)
package Tree;import java.util.LinkedList;import java.util.Queue;public class Connect_117 { class Node { public int val; public Node left; public Node right; public Node next; public N...原创 2020-02-07 22:32:08 · 156 阅读 · 0 评论 -
116. Populating Next Right Pointers in Each Node(二叉树)
package Recursion;import java.util.Stack;public class Connect_116 { class Node { public int val; public Node left; public Node right; public Node next; public Node() {}...原创 2020-02-07 21:53:31 · 124 阅读 · 0 评论 -
113. Path Sum II(递归、深搜)
package Recursion;import java.util.ArrayList;import java.util.List;public class PathSum_113 { public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = ...原创 2020-02-07 19:48:58 · 101 阅读 · 0 评论 -
112. Path Sum(深搜、递归)
package Recursion;public class HasPathSum_112 { public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } } public boolean hasPathSum(TreeNode ro...原创 2020-02-07 14:12:31 · 111 阅读 · 0 评论 -
114. Flatten Binary Tree to Linked List(深搜)
package Recursion;public class Flatten_114 { public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } } public void flatten(TreeNode root) { wh...原创 2020-02-07 13:47:08 · 105 阅读 · 0 评论 -
105. Construct Binary Tree from Preorder and Inorder Traversal
package Recursion;public class BuildTree_105 { public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } } // 105. Construct Binary Tree from Pre...原创 2020-02-06 16:42:47 · 108 阅读 · 0 评论 -
109. Convert Sorted List to Binary Search Tree(快慢指针、递归、BST)
package Depth_first_Search;public class SortedListToBST_109 { public class ListNode { int val; ListNode next; ListNode(int x) { val = x; } } public class TreeNode { int val; Tre...原创 2020-02-06 15:18:48 · 132 阅读 · 0 评论 -
684. Redundant Connection(并查集)
package Union_Find;public class FindRedundantConnection_684 { public static void main(String[] args) { FindRedundantConnection_684 f=new FindRedundantConnection_684(); int[][] edges= new int[][...原创 2020-02-05 16:52:03 · 107 阅读 · 0 评论 -
1319. Number of Operations to Make Network Connected(并查集)
package Union_Find;public class MakeConnected_1319 { // 1319. Number of Operations to Make Network Connected int[] P; // 剩余的线 int count; public int makeConnected(int n, int[][] connections) {...原创 2020-02-05 16:10:16 · 231 阅读 · 0 评论 -
200. Number of Islands(深搜)
package Union_Find;public class NumIslands_200 { // 200. Number of Islands /* * Given a 2d grid map of '1's (land) and '0's (water), count the number of * islands. An island is surrounded by w...原创 2020-02-05 15:10:46 · 130 阅读 · 0 评论 -
783. Minimum Distance Between BST Nodes(递归)
package Recursion;public class MinDiffInBST_783 { // 783. Minimum Distance Between BST Nodes /* * Given a Binary Search Tree (BST) with the root node root, return the minimum * difference bet...原创 2020-02-04 16:22:40 · 126 阅读 · 0 评论 -
1137. N-th Tribonacci Number(递归)
package Recursion;public class Tribonacci_1137 { // 1137. N-th Tribonacci Number /* Example 1: Input: n = 4 Output: 4 Explanation: T_3 = 0 + 1 + 1 = 2 T_4 = 1 + 1 + 2 = 4 Example 2:...原创 2020-02-04 15:49:27 · 214 阅读 · 0 评论 -
938. Range Sum of BST(递归)
package Recursion;public class RangeSumBST_938 { public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val = x; } } int sum=0; public int rangeSumBST(T...原创 2020-02-04 15:25:25 · 160 阅读 · 0 评论 -
973. K Closest Points to Origin
package Sort;import java.util.Arrays;import java.util.Comparator;import java.util.LinkedList;import java.util.List;public class KClosest_973 { // 973. K Closest Points to Origin/* We have a l...原创 2020-02-03 20:05:33 · 108 阅读 · 0 评论 -
969. Pancake Sorting(排序)
package Sort;import java.util.ArrayList;import java.util.Arrays;import java.util.List;public class PancakeSort_969 { // 969. Pancake Sorting /* * Given an array A, we can perform a pancake f...原创 2020-02-03 17:49:41 · 302 阅读 · 0 评论 -
1329. Sort the Matrix Diagonally
package Sort;import java.util.ArrayList;import java.util.Collections;import java.util.List;public class DiagonalSort_1329 { // 1329. Sort the Matrix Diagonally // 思路： // 找出所有对角线起点，将每条对角线上的元素放...原创 2020-02-03 17:45:22 · 348 阅读 · 0 评论 -
1305. 两棵二叉搜索树中的所有元素(递归、排序、二叉树)
package Sort;import java.util.ArrayList;import java.util.List;public class GetAllElements_1305 { // 1305. 两棵二叉搜索树中的所有元素 public class TreeNode { int val; TreeNode left; TreeNode right;...原创 2020-02-03 17:44:39 · 165 阅读 · 0 评论 -
75. 颜色分类(三指针)
package Sort;public class SortColors_75 { // 75. 颜色分类 /* * 给定一个包含红色、白色和蓝色，一共 n 个元素的数组，原地对它们进行排序，使得相同颜色的元素相邻，并按照红色、白色、蓝色顺序排列。 * * 此题中，我们使用整数 0、 1 和 2 分别表示红色、白色和蓝色。 * * 注意: 不能使用代码库中的排序函数...原创 2020-02-02 22:34:21 · 128 阅读 · 0 评论 -
56. 合并区间
package Sort;import java.util.ArrayList;import java.util.Arrays;import java.util.Comparator;import java.util.List;public class Merge_56 {// 56. 合并区间/* 给出一个区间的集合，请合并所有重叠的区间。 示例 1: 输入: [[1,...原创 2020-02-02 22:33:52 · 113 阅读 · 0 评论 -
173. 二叉搜索树迭代器
package Stack;import java.util.ArrayList;import java.util.List;public class BSTIterator_173 { public class TreeNode { int val; TreeNode left; TreeNode right; TreeNode(int x) { val ...原创 2020-02-02 16:44:58 · 104 阅读 · 0 评论 -
150. 逆波兰表达式求值
package Stack;import java.util.Stack;public class EvalRPN_150 { /* * 根据逆波兰表示法，求表达式的值。 * * 有效的运算符包括 +, -, *, / 。每个运算对象可以是整数，也可以是另一个逆波兰表达式。 * * 说明： * * 整数除法只保留整数部分。 给定逆波兰表达式总是有效的。换...原创 2020-02-02 16:44:25 · 97 阅读 · 0 评论 -
144. 二叉树的前序遍历
package Stack;import java.util.ArrayList;import java.util.List;import java.util.Stack;public class PreorderTraversal_144 { public class TreeNode { int val; TreeNode left; TreeNode right;...原创 2020-02-02 16:44:00 · 141 阅读 · 0 评论 -
103. 二叉树的锯齿形层次遍历
package Stack;import java.util.ArrayList;import java.util.List;import java.util.Stack;public class ZigzagLevelOrder_103 { /* * 给定一个二叉树，返回其节点值的锯齿形层次遍历。（即先从左往右，再从右往左进行下一层遍历，以此类推，层与层之间交替进行）。 *...原创 2020-02-02 16:43:24 · 95 阅读 · 0 评论 -
94. 二叉树的中序遍历
package Stack;import java.util.ArrayList;import java.util.List;import java.util.Stack;public class InorderTraversal_94 { public class TreeNode { int val; TreeNode left; TreeNode right; ...原创 2020-02-02 16:42:48 · 78 阅读 · 0 评论 -
71. 简化路径
package Stack;import java.util.Stack;public class SimplifyPath_71 { public static void main(String[] args) { String s=simplifyPath("/../"); System.out.println(s); } // 分析过程： // 先分割字符串...原创 2020-02-02 16:41:08 · 161 阅读 · 0 评论