ͻ񻣼
public class Solution { public String longestPalindrome(String s) { int len = s.length(); if (len < 2) { return s; } int maxLen = 1; int begin = 0; // ÔĶÁÈ«ÎÄ
ͻ񻣼
1. apolloÅäÖÃÒÔ¶ººÅ·Ö¸îµÄ×Ö·û´®£¬×ª»¯Îªlist @Value("#{'${huobi.actualAdjustSymbols:,}'.split(',')}") private List<String> actualAdjustSymbols; 2.appolloÅäÖÃת»¯Îªmap msg- ÔĶÁÈ«ÎÄ
ͻ񻣼
¸ø¶¨Ò»¸öÔ´®ºÍÄ¿±ê´®£¬ÄܶÔÔ´´®½øÐÐÈçϲÙ×÷£º1.ÔÚ¸ø¶¨Î»ÖòåÈëÒ»¸ö×Ö·û2.Ìæ»»Èa56爆大奖在线娱乐â×Ö·û3.ɾ³ýÈa56爆大奖在线娱乐â×Ö·û ÒªÇóÍê³ÉһϺ¯Êý£¬·µ»Ø×îÉٵIJÙ×÷Êý£¬Ê¹µÃÔ´´®½øÐÐÕâЩ²Ù×÷ºóµÈÓÚÄ¿±ê´®¡£Ô´´®ºÍÄ¿±ê´®³¤¶È¶¼Ð¡ÓÚ2000¡£ ÔĶÁÈ«ÎÄ
ͻ񻣼
¸ø³öÒ»¸öÓÐÐòÊý×飬ÇëÔÚÊý×éÖÐÕÒ³öÄ¿±êÖµµÄÆðʼλÖúͽáÊøλÖà ÄãµÄËã·¨µÄʱ¼ä¸´ÔÓ¶ÈÓ¦¸ÃÔÚO(log n)Ö®ÄÚ Èç¹ûÊý×éÖв»´æÔÚÄ¿±ê£¬·µ»Ø[-1, -1]. ÀýÈ磺 ¸ø³öµÄÊý×éÊÇ[50, 70, 70, 80, 80, 100]£¬Ä¿±êÖµÊÇ80, ·µ»Ø[3, 4]. /**** Á½´Î¶þ·Ö²éÕÒ**/ pub ÔĶÁÈ«ÎÄ
ͻ񻣼
class Solution { public boolean validPalindrome(String s) { char ch[] = s.toCharArray(); int l = 0, r = ch.length - 1; while(l < r) { if(ch[l] == ch[r ÔĶÁÈ«ÎÄ
ͻ񻣼
public ListNode reverseList(ListNode head) { if(head==null || head.next ==null){ return head; } ListNode cur = head.next; head.next = null; while(cur! ÔĶÁÈ«ÎÄ
ͻ񻣼
¸ø¶¨Ò»¸ö×Ö·û´®£¬ÑéÖ¤ËüÊÇ·ñÊÇ»ØÎÄ´®£¬Ö»¿¼ÂÇ×ÖĸºÍÊý×Ö×Ö·û£¬¿ÉÒÔºöÂÔ×ÖĸµÄ´óСд¡£ public boolean isPalindrome(String s) { int n = s.length(); int left = 0, right = n - 1; while (left < right) ÔĶÁÈ«ÎÄ
¸ÃÎı»ÃÜÂë±£»¤¡£ ÔĶÁÈ«ÎÄ
ͻ񻣼
public ListNode rotateRight(ListNode head, int k) { if(head==null||head.next==null||k==0){ return head; } ListNode slow = head; ListNode fast = head; ÔĶÁÈ«ÎÄ
ͻ񻣼
¸ø¶¨Ò»¸öÕûÊýÊý×é nums £¬ÕÒµ½Ò»¸ö¾ßÓÐ×î´óºÍµÄÁ¬Ðø×ÓÊý×飨×ÓÊý×é×îÉÙ°üº¬Ò»¸öÔªËØ£©£¬·µ»ØÆä×î´óºÍ¡£ ʾÀý: ÊäÈë: [-2,1,-3,4,-1,2,1,-5,4], Êä³ö: 6 ½âÊÍ: Á¬Ðø×ÓÊý×é [4,-1,2,1] µÄºÍ×î´ó£¬Îª 6¡££¨Ö»Çó×î´ó×ÓÐòºÍ£¬²»ÊÇ×î´ó×ÓÐòÇø¼ä£© ˼· ¼ÙÉè nums ÔĶÁÈ«ÎÄ