From 4c2d039f11d8e21d30caf07f7c9b1f2c1afc0877 Mon Sep 17 00:00:00 2001
From: GreyZeng <410486047@qq.com>
Date: Sun, 18 Dec 2022 13:29:30 +0800
Subject: [PATCH] update code

---
 .../LintCode_1530_EncodeNaryTreeToBinaryTree.java"              | 2 +-
 .../\345\233\276/LintCode_0629_MinimumSpanningTree.java"        | 2 +-
 .../\345\240\206/LintCode_0550_TopKFrequentWordsII.java"        | 2 +-
 3 files changed, 3 insertions(+), 3 deletions(-)
 rename "src/main/java/\347\273\203\344\271\240\351\242\230/lintcode/hard/LintCode_1530_EncodeNaryTreeToBinaryTree.java" => "src/main/java/\346\225\260\346\215\256\347\273\223\346\236\204/\344\272\214\345\217\211\346\240\221/LintCode_1530_EncodeNaryTreeToBinaryTree.java" (98%)
 rename "src/main/java/\347\273\203\344\271\240\351\242\230/lintcode/hard/LintCode_0629_MinimumSpanningTree.java" => "src/main/java/\346\225\260\346\215\256\347\273\223\346\236\204/\345\233\276/LintCode_0629_MinimumSpanningTree.java" (99%)
 rename "src/main/java/\347\273\203\344\271\240\351\242\230/lintcode/hard/LintCode_0550_TopKFrequentWordsII.java" => "src/main/java/\346\225\260\346\215\256\347\273\223\346\236\204/\345\240\206/LintCode_0550_TopKFrequentWordsII.java" (99%)

diff --git "a/src/main/java/\347\273\203\344\271\240\351\242\230/lintcode/hard/LintCode_1530_EncodeNaryTreeToBinaryTree.java" "b/src/main/java/\346\225\260\346\215\256\347\273\223\346\236\204/\344\272\214\345\217\211\346\240\221/LintCode_1530_EncodeNaryTreeToBinaryTree.java"
similarity index 98%
rename from "src/main/java/\347\273\203\344\271\240\351\242\230/lintcode/hard/LintCode_1530_EncodeNaryTreeToBinaryTree.java"
rename to "src/main/java/\346\225\260\346\215\256\347\273\223\346\236\204/\344\272\214\345\217\211\346\240\221/LintCode_1530_EncodeNaryTreeToBinaryTree.java"
index 0e6b2ca1..faa195eb 100644
--- "a/src/main/java/\347\273\203\344\271\240\351\242\230/lintcode/hard/LintCode_1530_EncodeNaryTreeToBinaryTree.java"
+++ "b/src/main/java/\346\225\260\346\215\256\347\273\223\346\236\204/\344\272\214\345\217\211\346\240\221/LintCode_1530_EncodeNaryTreeToBinaryTree.java"
@@ -1,4 +1,4 @@
-package 练习题.lintcode.hard;
+package 数据结构.二叉树;
 
 import java.util.ArrayList;
 import java.util.List;
diff --git "a/src/main/java/\347\273\203\344\271\240\351\242\230/lintcode/hard/LintCode_0629_MinimumSpanningTree.java" "b/src/main/java/\346\225\260\346\215\256\347\273\223\346\236\204/\345\233\276/LintCode_0629_MinimumSpanningTree.java"
similarity index 99%
rename from "src/main/java/\347\273\203\344\271\240\351\242\230/lintcode/hard/LintCode_0629_MinimumSpanningTree.java"
rename to "src/main/java/\346\225\260\346\215\256\347\273\223\346\236\204/\345\233\276/LintCode_0629_MinimumSpanningTree.java"
index 332ee4cd..ab3eebcf 100644
--- "a/src/main/java/\347\273\203\344\271\240\351\242\230/lintcode/hard/LintCode_0629_MinimumSpanningTree.java"
+++ "b/src/main/java/\346\225\260\346\215\256\347\273\223\346\236\204/\345\233\276/LintCode_0629_MinimumSpanningTree.java"
@@ -25,7 +25,7 @@
 // 没有办法连通
 // 注意事项
 // 返回按cost排序的连接方法，如果cost相同就按照city1进行排序，如果city1也相同那么就按照city2进行排序。
-package 练习题.lintcode.hard;
+package 数据结构.图;
 
 import java.util.*;
 
diff --git "a/src/main/java/\347\273\203\344\271\240\351\242\230/lintcode/hard/LintCode_0550_TopKFrequentWordsII.java" "b/src/main/java/\346\225\260\346\215\256\347\273\223\346\236\204/\345\240\206/LintCode_0550_TopKFrequentWordsII.java"
similarity index 99%
rename from "src/main/java/\347\273\203\344\271\240\351\242\230/lintcode/hard/LintCode_0550_TopKFrequentWordsII.java"
rename to "src/main/java/\346\225\260\346\215\256\347\273\223\346\236\204/\345\240\206/LintCode_0550_TopKFrequentWordsII.java"
index 36aa8065..cc1c0ce6 100644
--- "a/src/main/java/\347\273\203\344\271\240\351\242\230/lintcode/hard/LintCode_0550_TopKFrequentWordsII.java"
+++ "b/src/main/java/\346\225\260\346\215\256\347\273\223\346\236\204/\345\240\206/LintCode_0550_TopKFrequentWordsII.java"
@@ -10,7 +10,7 @@
  * 输入： TopK(1) add("aa") add("ab") topk() 输出：["aa"] 解释： "aa" 和 "ab" 出现 , 但是aa的字典序小于ab。 注意事项
  * 如果两个单词有相同的使用频率, 按字典序排名.
  */
-package 练习题.lintcode.hard;
+package 数据结构.堆;
 
 import java.util.ArrayList;
 import java.util.Comparator;
-- 
GitLab