update package

pom.xml

@@ -5,7 +5,7 @@
     <modelVersion>4.0.0</modelVersion>
     <groupId>git.snippet</groupId>
     <artifactId>algorithm</artifactId>
-    <version>3.0.RELEASE</version>
+    <version>3.1.RELEASE</version>
     <properties>
         <java.version>17</java.version>
         <maven.compiler.source>${java.version}</maven.compiler.source>

src/main/java/c二分/Code_IsStepSum.java → src/main/java/binarysearch/Code_IsStepSum.java

-package c二分;
+package binarysearch;
 
 import java.util.HashMap;
 

src/main/java/c二分/LeetCode_0034_FindFirstAndLastPositionOfElementInSortedArray.java → src/main/java/binarysearch/LeetCode_0034_FindFirstAndLastPositionOfElementInSortedArray.java

-package c二分;
+package binarysearch;
 
 // 二分查找
 // 给你一个按照非递减顺序排列的整数数组 nums，和一个目标值 target。请你找出给定目标值在数组中的开始位置和结束位置。

src/main/java/c二分/LeetCode_0035_SearchInsertPosition.java → src/main/java/binarysearch/LeetCode_0035_SearchInsertPosition.java

-package c二分;
+package binarysearch;
 
 // 笔记：https://www.cnblogs.com/greyzeng/p/16622554.html
 // 二分查找： 在一个有序数组中，找大于等于某个数最左侧的位置，如果找不到，则返回数组长度

src/main/java/c二分/LeetCode_0162_FindPeakElement.java → src/main/java/binarysearch/LeetCode_0162_FindPeakElement.java

-package c二分;
+package binarysearch;
 
 // 数据量
 // 1 <= nums.length <= 1000

src/main/java/c二分/LeetCode_0410_SplitArrayLargestSum.java → src/main/java/binarysearch/LeetCode_0410_SplitArrayLargestSum.java

-package c二分;
+package binarysearch;
 
 // TODO
 // 给定一个非负整数数组 nums 和一个整数 m ，你需要将这个数组分成 m 个非空的连续子数组。设计一个算法使得这 m 个子数组各自和的最大值最小。

src/main/java/c二分/LeetCode_0704_BinarySearch.java → src/main/java/binarysearch/LeetCode_0704_BinarySearch.java

-package c二分;
+package binarysearch;
 
 // 笔记：https://www.cnblogs.com/greyzeng/p/16622554.html
 // 二分查找：在一个有序数组中，找某个数是否存在

src/main/java/c二分/LintCode_0006_MergeTwoSortedArrays.java → src/main/java/binarysearch/LintCode_0006_MergeTwoSortedArrays.java

-package c二分;
+package binarysearch;
 
 // How can you optimize your algorithm if one array is very large and the other is very small?
 // https://www.lintcode.com/problem/6/

src/main/java/d栈和队列/Code_ArrayToStackAndQueue.java → src/main/java/queueandstack/Code_ArrayToStackAndQueue.java

-package d栈和队列;
+package queueandstack;
 
 import java.util.ArrayList;
 

src/main/java/d栈和队列/Code_DoubleEndsToStackAndQueue.java → src/main/java/queueandstack/Code_DoubleEndsToStackAndQueue.java

-package d栈和队列;
+package queueandstack;
 
 
 import java.util.LinkedList;

src/main/java/d栈和队列/LeetCode_0641_DesignCircularDeque.java → src/main/java/queueandstack/LeetCode_0641_DesignCircularDeque.java

-package d栈和队列;
+package queueandstack;
 
 
 /**

src/main/java/d栈和队列/LintCode_0423_ValidParentheses.java → src/main/java/queueandstack/LintCode_0423_ValidParentheses.java

-package d栈和队列;
+package queueandstack;
 
 import java.util.LinkedList;