leecode更新
This commit is contained in:
parent
771f6f7c32
commit
2211cb9ed1
|
|
@ -1,6 +1,7 @@
|
||||||
package com.markilue.leecode.hot100;
|
package com.markilue.leecode.hot100;
|
||||||
|
|
||||||
import com.markilue.leecode.tree.TreeNode;
|
import com.markilue.leecode.tree.TreeNode;
|
||||||
|
import org.junit.Test;
|
||||||
|
|
||||||
/**
|
/**
|
||||||
*@BelongsProject: Leecode
|
*@BelongsProject: Leecode
|
||||||
|
|
@ -16,6 +17,13 @@ import com.markilue.leecode.tree.TreeNode;
|
||||||
*@Version: 1.0
|
*@Version: 1.0
|
||||||
*/
|
*/
|
||||||
public class T99_MergeTrees {
|
public class T99_MergeTrees {
|
||||||
|
@Test
|
||||||
|
public void test() {
|
||||||
|
Integer i = 1000;
|
||||||
|
Integer j = 1000;
|
||||||
|
System.out.println(i == j);
|
||||||
|
System.out.println(i.equals(j));
|
||||||
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* 递归法
|
* 递归法
|
||||||
|
|
@ -24,6 +32,8 @@ public class T99_MergeTrees {
|
||||||
* @return
|
* @return
|
||||||
*/
|
*/
|
||||||
public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
|
public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
|
||||||
|
|
||||||
|
|
||||||
if (root1 == null) {
|
if (root1 == null) {
|
||||||
return root2;
|
return root2;
|
||||||
} else if (root2 == null) {
|
} else if (root2 == null) {
|
||||||
|
|
|
||||||
|
|
@ -0,0 +1,17 @@
|
||||||
|
package com.markilue.leecode.sort;
|
||||||
|
|
||||||
|
/**
|
||||||
|
*@BelongsProject: Leecode
|
||||||
|
*@BelongsPackage: com.markilue.leecode.sort
|
||||||
|
*@Author: markilue
|
||||||
|
*@CreateTime: 2023-04-11 16:00
|
||||||
|
*@Description: TODO
|
||||||
|
*@Version: 1.0
|
||||||
|
*/
|
||||||
|
public class HeapSort {
|
||||||
|
|
||||||
|
|
||||||
|
public void heapSort(){
|
||||||
|
|
||||||
|
}
|
||||||
|
}
|
||||||
Loading…
Reference in New Issue