From f96e0519e02b960435e85f2418b26aaad7048cfd Mon Sep 17 00:00:00 2001
From: Nezuko-Wen <409053122@qq.com>
Date: Mon, 29 Jun 2020 02:04:03 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B7=BB=E5=8A=A0=E9=A2=98=E7=9B=AE=E8=AF=B4?=
 =?UTF-8?q?=E6=98=8E?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 src/Question12.java | 3 +++
 src/Question13.java | 3 +++
 src/Question14.java | 3 +++
 src/Question15.java | 3 +++
 src/Question17.java | 3 +++
 src/Question23.java | 3 +++
 src/Question25.java | 3 +++
 src/Question26.java | 3 +++
 8 files changed, 24 insertions(+)

diff --git a/src/Question12.java b/src/Question12.java
index 73c0ad9..49aae4f 100644
--- a/src/Question12.java
+++ b/src/Question12.java
@@ -1,3 +1,6 @@
+/**
+ * 矩阵中是否含有某字符串
+ */
 public class Question12 {
     public static void main(String[] args) {
         char[][] proNums = new char[][]{{'a','b','e'},{'c','d','f'},{'g','h','i'}};
diff --git a/src/Question13.java b/src/Question13.java
index 1b16a2c..291a672 100644
--- a/src/Question13.java
+++ b/src/Question13.java
@@ -1,3 +1,6 @@
+/**
+ *
+ */
 public class Question13 {
     static int maxRow = 3;
     static int maxCol = 3;
diff --git a/src/Question14.java b/src/Question14.java
index e819c8d..293c2a4 100644
--- a/src/Question14.java
+++ b/src/Question14.java
@@ -1,3 +1,6 @@
+/**
+ * 剪绳子，绳子长度乘积最大
+ */
 public class Question14 {
     public static void main(String[] args) {
         int length = 8;
diff --git a/src/Question15.java b/src/Question15.java
index d950c8f..97e8807 100644
--- a/src/Question15.java
+++ b/src/Question15.java
@@ -1,3 +1,6 @@
+/**
+ * 一个数的二进制含有多少个1
+ */
 public class Question15 {
     public static void main(String[] args) {
         int a = 5;
diff --git a/src/Question17.java b/src/Question17.java
index 1a539e0..35d125d 100644
--- a/src/Question17.java
+++ b/src/Question17.java
@@ -1,3 +1,6 @@
+/**
+ * 输出1-n位数，1-3位数即1-999
+ */
 public class Question17 {
     public static void main(String[] args) {
         int condition = 3;
diff --git a/src/Question23.java b/src/Question23.java
index c4e3c70..5024efa 100644
--- a/src/Question23.java
+++ b/src/Question23.java
@@ -1,3 +1,6 @@
+/**
+ * 寻找链表中环的入口节点
+ */
 public class Question23 {
     public static void main(String[] args) {
         ListNode head = new ListNode(1);
diff --git a/src/Question25.java b/src/Question25.java
index cb5c560..d94c997 100644
--- a/src/Question25.java
+++ b/src/Question25.java
@@ -1,3 +1,6 @@
+/**
+ * 合并两个有序链表
+ */
 public class Question25 {
     public static void main(String[] args) {
         ListNode head1 = new ListNode(6);
diff --git a/src/Question26.java b/src/Question26.java
index 594003f..c13cf39 100644
--- a/src/Question26.java
+++ b/src/Question26.java
@@ -1,3 +1,6 @@
+/**
+ * 一个树是否包含另一个树
+ */
 public class Question26 {
     private static boolean findRoot = false;
     public static void main(String[] args) {