LeetCode Longest Palindromic Substring
来源：互联网 发布：淘宝网宝贝详情模板 编辑：程序博客网 时间：2024/06/05 02:48
<a target=_blank href="https://oj.leetcode.com/problems/longest-palindromic-substring/" target="_blank">原题地址</a>
public String longestPalindrome(String s) {int start = 0;int end = 0; boolean f[][] = new boolean[s.length()][s.length()]; for(int i = 1; i < s.length(); i++){ f[i][i] = true; f[i][i-1] = true; } for(int step = 2; step <= s.length(); step++){ for(int i = 0; step + i <= s.length(); i++){ int j = i + step - 1; if(s.charAt(i) == s.charAt(j) && f[i+1][j-1]){ f[i][j] = true; if(end - start + 1 < step){ start = i; end = j; } } } } return s.substring(start, end + 1);} 0 0
- LeetCode: Longest Palindromic Substring
- LeetCode Longest Palindromic Substring
- LeetCode: Longest Palindromic Substring
- [Leetcode] Longest Palindromic Substring
- [LeetCode] Longest Palindromic Substring
- Leetcode : Longest Palindromic Substring
- [LeetCode]Longest Palindromic Substring
- leetcode Longest Palindromic Substring
- LeetCode-Longest Palindromic Substring
- [LeetCode] Longest Palindromic Substring
- Longest Palindromic Substring leetcode
- LeetCode Longest Palindromic Substring
- LeetCode - Longest Palindromic Substring
- LeetCode -- Longest Palindromic Substring
- LeetCode | Longest Palindromic Substring
- LeetCode: Longest Palindromic Substring
- [LeetCode]Longest Palindromic Substring
- leetcode Longest Palindromic Substring
- DSP-BIOS使用入门
- php 判断文件或目录是否存在
- 什么情况下可以不写PHP的结束标签“?>”
- Android AIDL使用详解
- 【爱上Java8】ACC_SUPER和早期的invokespecial
- LeetCode Longest Palindromic Substring
- Fiddler参数解读
- 第一个chrome应用
- 使用Tcl脚本分配FPGA管脚
- 到底选择合成还是继承
- 大学一年之后的总结
- switch case 语句特征
- UVA - 1435 Business Cards （数论）
- Markdown中插入数学公式的方法
