qq_26511139的博客

public ListNode reverse(ListNode head){ // 递归到最后一个节点，返回新的新的头结点 if (head.next == null) { return head; } ListNode newHead = reverse(head.next); head.next.next = head; head.next = null; retu.

func longestPalindrome(s string) string { str:= s b := make([]byte, 2*len(str)+2) p := make([]int,2*len(str)+2) b[0] = '!' b[1] = '#' right, center, maxlen, maxcenter := 0, 0, 1, 0 for i := 0; i < len(str); i++ { b[2*i+2] = str[i] b[2*i+3] =

class Solution { /** * @param String $s * @return String */ function longestPalindrome($s) { $newstr= '!#'; for ($i = 0; $i < strlen($s); ++$i) { $newstr .= $s[$i] . '#'; } $right = 0; $center = 0; $maxl.