LeetCode-521 Longest Uncommon Subsequence I 最长不公共子串
来源:互联网 发布:网络挂机赚钱平台 编辑:程序博客网 时间:2024/06/08 02:34
题目链接
这道题目不愧是easy的,数据量小,只有串长只有100,,,完全不用什么算法,直接枚举过,就当练练C++程序设计基础了。
分别枚举A串和B串的所有子串,匹配另一个串中是否有,若没有,则为不公共子串,更新ans。
放下代码
class Solution {public: int findLUSlength(string a, string b) { int ans = 0; for (int pos = 0; pos < a.length(); pos ++) { for (int len = 1; pos + len <= a.length(); len ++) { if (b.find(a.substr(pos, len)) == -1) { //cout << a.substr(pos, len) << endl; ans = max(ans, len); } } } for (int pos = 0; pos < b.length(); pos ++) { for (int len = 1; pos + len <= b.length(); len ++) { if (a.find(b.substr(pos, len)) == -1) { //cout << b.substr(pos, len) << endl; ans = max(ans, len); } } } if (a.length() == 0 || b.length() == 0) ans = max(a.length(), b.length()); if (ans == 0) return -1; return ans; }};
阅读全文
0 0
- LeetCode-521 Longest Uncommon Subsequence I 最长不公共子串
- 字符串-leetcode 521 Longest Uncommon Subsequence I
- 【LeetCode】521 Longest Uncommon Subsequence I
- Leetcode 521 Longest Uncommon Subsequence I
- Longest Uncommon Subsequence I(leetcode)
- 521 Longest Uncommon Subsequence I
- LeetCode 521:Longest Uncommon Subsequence I (C++)
- leetcode 521. Longest Uncommon Subsequence I
- 【Leetcode】521. Longest Uncommon Subsequence I
- LeetCode 521. Longest Uncommon Subsequence I
- [LeetCode]521. Longest Uncommon Subsequence I
- leetcode 521. Longest Uncommon Subsequence I
- [leetcode]: 521. Longest Uncommon Subsequence I
- [leetcode]521. Longest Uncommon Subsequence I
- [LeetCode]521. Longest Uncommon Subsequence I
- LeetCode: 521. Longest Uncommon Subsequence I
- [leetcode]521. Longest Uncommon Subsequence I
- LeetCode-521. Longest Uncommon Subsequence I
- MagicButton
- powershell控制台字体改为consolas
- 数据库大小写敏感
- Java精选笔记_Tomcat开发Web站点
- mysql 导出前缀相同表小脚本
- LeetCode-521 Longest Uncommon Subsequence I 最长不公共子串
- Shiro框架Ini配置(四)
- shell——3(网站数据备份注意事项)
- 新增数据表或字段
- FFPlay是一个使用了 ffmpeg 和 sdl 库的、一个简单的可移植的媒体播放器。
- hdu 1281 棋盘游戏
- 创建序列
- ajax 基础例子
- 【Hadoop--03】HDFS写文件