@@ -129,11 +129,41 @@ export var numIdenticalPairs = function (nums = [1, 2, 3, 1, 1, 3]) {
129129export var checkZeroOnes = function ( s = "1" ) {
130130 const one = s . match ( / 1 + / g) || [ ]
131131 const o = s . match ( / 0 + / g) || [ ]
132- let onelen = 0 , olen = 0 ;
133- one . forEach ( ele => ele . length > onelen ? onelen = ele . length : null )
134- o . forEach ( ele => ele . length > olen ? olen = ele . length : null )
135- if ( onelen > olen ) {
132+ let onelen = 0 , olen = 0 ;
133+ one . forEach ( ele => ele . length > onelen ? onelen = ele . length : null )
134+ o . forEach ( ele => ele . length > olen ? olen = ele . length : null )
135+ if ( onelen > olen ) {
136136 return true
137137 }
138138 return false
139- } ;
139+ } ;
140+ // 图解字节&拼多多&leetcode14:最长公共前缀
141+ // 输入: ["flower","flow","flight"]
142+ // 输出: "fl"
143+ /**
144+ *
145+ * @param { string[] } strs
146+ */
147+ const findMaxLength = ( strs ) => {
148+ if ( ! strs || strs . length === 0 ) return strs ;
149+ let firstStr = strs [ 0 ]
150+ for ( let i = 1 ; i < strs . length ; i ++ ) {
151+ let j = 0 ;
152+ for ( ; j < firstStr . length && j < strs [ i ] . length ; j ++ ) {
153+ if ( firstStr [ j ] !== strs [ i ] [ j ] ) break
154+ }
155+ firstStr = firstStr . substr ( 0 , j )
156+ }
157+ return firstStr
158+ }
159+ /**151. 翻转字符串里的单词
160+ * @param {string } s
161+ * @return {string }
162+ */
163+ var reverseWords = function ( s ) {
164+ if ( ! s || s . length === 0 ) return '' ;
165+ return s . trim ( ) . split ( ' ' ) . filter ( ele => ele !== '' ) . reverse ( ) . join ( " " )
166+ } ;
167+ // console.log(findMaxLength(["flower", "flow", "flight"]))
168+
169+ console . log ( reverseWords ( "a good example" ) )
0 commit comments