521. Longest Uncommon Subsequence I的C++解法
来源:互联网 发布:解答问题的软件 编辑:程序博客网 时间:2024/05/22 03:51
一开始没看明白这个题,后来才发现非常弱智。因为问的是最长的不相同子串,那么只要两个字符串不相等就返回较长字符串的长度就好了。
class Solution {public:int findLUSlength(string a, string b) { if (a==b) return -1; else return a.length()>b.length() ? a.length():b.length();}};
在std::string 里比较字符串相等可以直接用==,如果是字符数组则要用strcmp。
是的我就是那个智障。
0 0
- 521. Longest Uncommon Subsequence I的C++解法
- Longest Uncommon Subsequence I问题及解法
- 521. Longest Uncommon Subsequence I
- 521. Longest Uncommon Subsequence I
- 521. Longest Uncommon Subsequence I
- 521. Longest Uncommon Subsequence I
- 521. Longest Uncommon Subsequence I
- 521.Longest Uncommon Subsequence I
- 521. Longest Uncommon Subsequence I
- 521. Longest Uncommon Subsequence I
- 521. Longest Uncommon Subsequence I
- 521. Longest Uncommon Subsequence I
- 521. Longest Uncommon Subsequence I
- 521. Longest Uncommon Subsequence I
- 521. Longest Uncommon Subsequence I
- 521. Longest Uncommon Subsequence I
- 521. Longest Uncommon Subsequence I
- 521. Longest Uncommon Subsequence I
- Toolbar踩坑指南
- 异常问题:java.sql.SQLException: Column count doesn't match value count at row 1
- Struts2的用法之二
- 【深度学习】---行人检测应用
- WebDriver Selenium eclipse环境搭建
- 521. Longest Uncommon Subsequence I的C++解法
- Collections集合框架工具类
- LeetCode#6. ZigZag Conversion
- 深入解析MySQL分区(Partition)功能
- CH340驱动(含各平台)
- 5杀电影 walker 的评分8.0以上的电影
- java 二进制,八进制,十进制,十六进制间相互转换的方法
- centos 7.2 搭建svn服务器
- 优秀而强行的十进制快速幂