馃憦馃憦馃憦鍝堝柦锛佸ぇ瀹跺ソ锛屾垜鏄儹鐖卞垎浜悇绉嶆妧鏈殑鍗氫富銆愬鏃犳澧冨皬濂囥€戯紒馃槏馃槏馃槏鍦ㄦ垜鐨勫崥瀹㈤噷锛屾瘡涓€鏉℃妧鏈矾寰勬垜閮戒翰鑷帰绱㈣繃锛屾瘡涓€琛屼唬鐮佹垜閮藉疄闄呰繍琛岃繃銆備粖澶╋紝鎴戣鍜屽ぇ瀹跺垎浜叧浜嶭eetCode绠楁硶鐨勪竴涓粡鍏搁棶棰樷€斺€旀渶闀垮叕鍏卞墠缂€鐨勬寫鎴橈紒鉁娾湂鉁?/p>涓€銆丩eetCode绠楁硶涔嬫梾

馃敟 1銆佹帰瀵绘渶闀垮叕鍏卞墠缂€ 馃敟

馃幆 1.1銆侀鐩儗鏅?/p>

鎯宠薄涓€涓嬭繖鏍蜂竴涓満鏅細浣犻潰涓翠竴涓瓧绗︿覆鏁扮粍锛岄渶瑕佹壘鍑哄畠浠箣闂寸殑鏈€闀垮叕鍏卞墠缂€銆傚鏋滀笉瀛樺湪鍏叡鍓嶇紑锛屽氨杩斿洖绌哄瓧绗︿覆銆傛瘮濡傦紝杈撳叆鐨勬槸["flower","flow","flight"]锛岄偅涔堣緭鍑哄氨搴旇鏄?fl"銆?/p>

馃幆 1.2銆佹€濊矾瑙ｆ瀽

闈㈠杩欎釜闂锛屾垜浠彲浠ラ噰鍙栬繖鏍风殑绛栫暐锛氫粠绗竴涓瓧绗﹀紑濮嬶紝瀵绘壘鍏叡鐨勫墠缂€銆傚洜涓鸿繖涓墠缂€鏄渶闀跨殑锛屾墍浠ュ畠鐨勯暱搴︿笉浼氳秴杩囦换浣曚竴涓瓧绗︿覆鐨勯暱搴︺€傛垜浠彲浠ュ厛浠庣涓€涓瓧绗︿覆鍏ユ墜锛岀劧鍚庨€愪釜姣旇緝瀹冪殑姣忎釜瀛楃涓庡叾浠栧瓧绗︿覆鐨勭浉搴斾綅缃殑瀛楃鏄惁鐩稿悓銆傚鏋滃彂鐜颁笉鍚屽瓧绗︽垨宸茬粡姣旇緝瀹屾墍鏈夊瓧绗︿覆锛屽氨缁撴潫姣旇緝銆傝繖鏍凤紝鎴戜滑灏辫兘鎵惧埌鏈€闀垮叕鍏卞墠缂€銆?/p>

馃幆 1.3銆佺瓟妗堟彮鏅?/p>

涓嬮潰鏄竴娈佃В鍐宠繖涓棶棰樼殑Java浠ｇ爜锛?/p>

class Solution {

public String longestCommonPrefix(String[] strs) {

if(strs == null || strs.length == 0){

return "";

}

int length = strs[0].length();

int count = strs.length;

for(int i = 0; i < length; i++){

char c = strs[0].charAt(i);

for(int j = 1; j < count; j++){

if(i >= strs[j].length() || strs[j].charAt(i) != c){

return strs[0].substring(0,i);

}

}

}

return strs[0];

}

}

閫氳繃杩欐浠ｇ爜锛屾垜浠兘澶熸湁鏁堝湴鎵惧埌瀛楃涓叉暟缁勪腑鐨勬渶闀垮叕鍏卞墠缂€銆傚鏋滀綘瀵规妧鏈湁鐫€娴撳帤鐨勫叴瓒ｏ紝娆㈣繋鍏虫敞鎴戠殑鍗氬銆愬鏃犳澧冨皬濂囥€戯紝鍜屾垜涓€璧蜂氦娴佸涔犵殑蹇冨緱鍜屼綋楠岋紒馃槝馃槝馃槝鎰熻阿澶у鐨勯槄璇诲拰鏀寔锛佲潳锔忊潳锔忊潳锔?/p>