LeetCode----- 14.Longest Common Prefix
来源:互联网 发布:年度十大网络流行语 编辑:程序博客网 时间:2024/06/07 00:39
Write a function to find the longest common prefix string amongst an array of strings.
解题思路:首先从字符串数组中获取长度最小的字符串,然后循环遍历字符串数组,判断数组中的当前的字符串第一次出现最小字符串的位置,如果没有,则缩小最小字符串,如果最小字符串长度=0,则返回为“”。
public static String longestCommonPrefix(String[] strs) { if (strs.length == 0) return ""; int minlen = strs[0].length(); int index = 0; for (int i = 0; i < strs.length; i++) {if(minlen > strs[i].length()) {minlen = strs[i].length();index = i;}} String minStr = strs[index]; for (int i = 0; i < strs.length; i++) {if(index != i) {while(strs[i].indexOf(minStr) != 0) {minStr = minStr.substring(0,minStr.length()-1);if(minStr.isEmpty()) {return "";}}}} return minStr; }
public static String longestCommonPrefix3(String[] strs) { if (strs.length == 0) return ""; int minlen = strs[0].length(); int index = 0; for (int i = 0; i < strs.length; i++) {if(minlen > strs[i].length()) {minlen = strs[i].length();index = i;}} String minStr = strs[index]; for (int i = 0; i < minlen; i++) { char ch = minStr.charAt(i); for (int j = 0; j < strs.length; j++) {if(index != j) {if(i==strs[j].length() || strs[j].charAt(i) != ch) {return minStr.substring(0,i);}}}} return minStr; }
阅读全文
0 0
- [leetcode] 14. Longest Common Prefix[leetcode] 14. Longest Common Prefix
- [LeetCode]14.Longest Common Prefix
- LeetCode 14. Longest Common Prefix
- LeetCode --- 14. Longest Common Prefix
- LeetCode 14.Longest Common Prefix
- [Leetcode] 14. Longest Common Prefix
- 【leetcode】14. longest common prefix
- [leetcode] 14.Longest Common Prefix
- [leetcode] 14. Longest Common Prefix
- LeetCode - 14. Longest Common Prefix
- Leetcode-14. Longest Common Prefix
- Leetcode 14. Longest Common Prefix
- 14. Longest Common Prefix LeetCode
- leetcode 14. Longest Common Prefix
- leetcode 14. Longest Common Prefix
- leetcode 14. Longest Common Prefix
- LeetCode--14. Longest Common Prefix
- Leetcode 14. Longest Common Prefix
- java基础—equals和==的区别
- 人脸特征点检测(四)——Tasks-Constrained DCN(TCDCN)
- 第一章javaweb应用开发技术概述
- WEB_02_CSS_第六讲_CSS盒子模型
- centos 安装 rabbitMq
- LeetCode----- 14.Longest Common Prefix
- Java后台框架篇--Struts2.0之牛刀小试
- 二、Audio 架构
- Linux-4.9.2内核在mini2440上的移植(七)——NFS文件系统挂载
- 基于MCP2515的Linux CAN总线驱动程序设计(三)
- txt文件读写
- 数据结构——栈—表达式求值
- VC 实现注册表监控
- mongodb的查询过程