From aaf3129a43eaa4f89756cea1761766a591266501 Mon Sep 17 00:00:00 2001
From: liangjinglin <liangjinglin@hc-smart.com>
Date: Sun, 16 Feb 2025 16:45:39 +0800
Subject: [PATCH] =?UTF-8?q?2025-02-16=20=E5=9B=9E=E6=96=87=E4=B8=B2?=
 =?UTF-8?q?=E3=80=81=E6=96=97=E5=9C=B0=E4=B8=BB?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../java/leetcode/Huiwenchuan.java            | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)

diff --git a/src/dataANDcalc/java/leetcode/Huiwenchuan.java b/src/dataANDcalc/java/leetcode/Huiwenchuan.java
index 7c9a361..4c9f4fa 100644
--- a/src/dataANDcalc/java/leetcode/Huiwenchuan.java
+++ b/src/dataANDcalc/java/leetcode/Huiwenchuan.java
@@ -1,5 +1,24 @@
 package leetcode;
 
+
+//给你一个字符串 s，找到 s 中最长的
+//        回文
+//
+//        子串
+//        。
+//
+//
+//
+//        示例 1：
+//
+//        输入：s = "babad"
+//        输出："bab"
+//        解释："aba" 同样是符合题意的答案。
+//        示例 2：
+//
+//        输入：s = "cbbd"
+//        输出："bb"
+
 public class Huiwenchuan {
 
     private String longestPalindrome(String str){