赞
踩
- class Solution {
- public String longestCommonPrefix(String[] strs) {
- int n = strs.length;
- int ans = 0;
- int i = 0;
- int m = strs[0].length();
- boolean end = false;
- while (i<m&&!end) {
- char ch =strs[0].charAt(i);
- for (int j=1;j<n;j++) {
- if (i>=strs[j].length()||strs[j].charAt(i)!=ch) {
- end=true;
- break;
- }
- }
- if (!end) {
- ans++;
- }
- i++;
- }
- return strs[0].substring(0,ans);
- }
- }
Copyright © 2003-2013 www.wpsshop.cn 版权所有,并保留所有权利。