优化插入排序算法

chenweijie · chenweijie · commit 0aa1109eb2ef · 2020-05-11T00:49:58.000+08:00
diff --git a/src/main/java/com/chen/algorithm/sort/InsertSort.java b/src/main/java/com/chen/algorithm/sort/InsertSort.java
@@ -9,12 +9,11 @@ public class InsertSort {
 
     public static int[] sort(int[] array) {
 
-        int leftIndex;
         //从下标为1的元素开始选择合适的位置插入，因为下标为0的只有一个元素，默认是有序的
         for (int i = 1; i < array.length; i++) {
             //记录要插入的数据
             int temp = array[i];
-            leftIndex = i - 1;
+            int leftIndex = i - 1;
             //从已经排序的序列最右边的开始比较，找到比其小的数
             while (leftIndex >= 0 && temp < array[leftIndex]) {
                 //向后挪动
diff --git a/src/main/java/com/chen/algorithm/study/test14/Solution3.java b/src/main/java/com/chen/algorithm/study/test14/Solution3.java
@@ -0,0 +1,38 @@
+package com.chen.algorithm.study.test14;
+
+import org.junit.Test;
+
+/**
+ * @author :  chen weijie
+ * @Date: 2020-05-11 00:34
+ */
+public class Solution3 {
+
+    public String longestCommonPrefix(String[] strs) {
+        if (strs == null || strs.length == 0) {
+            return "";
+        }
+
+        String prex = strs[0];
+        for (int i = 1; i < strs.length; i++) {
+
+            while (!strs[i].startsWith(prex)) {
+                prex = prex.substring(0, prex.length() - 1);
+                if (prex.isEmpty()) {
+                    return "";
+                }
+            }
+        }
+        return prex;
+    }
+
+    @Test
+    public void testCase() {
+        String[] strings = {"flower", "flow", "flight"};
+
+        System.out.println(longestCommonPrefix(strings));
+
+
+    }
+
+}
