String:521. Longest Uncommon Subsequence I
来源:互联网 发布:大数据面试题 编辑:程序博客网 时间:2024/06/16 11:27
这是啥题啊……题目一直没理解对,看了答案才知道是这个意思……这题好没劲:
class Solution {public: int findLUSlength(string a, string b) { if(a.size()!=b.size()) return max(a.size(), b.size()); else { if(a!=b) return b.size(); } return -1; }};
阅读全文
0 0
- String: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
- 521. Longest Uncommon Subsequence I
- Longest Uncommon Subsequence I
- 在Fragment中使用QQ第三方登录时回调方法的问题
- xmlbeandefinitionreader defaultlistablebeanfactory (beanfactory 已被弃用)
- Windows上安装nodejs版本管理器nvm
- Java的HttpURLConnection通过POST请求中文乱码
- MonoDevelop编译
- String:521. Longest Uncommon Subsequence I
- 如何用mybatis实现多对多
- Mac读取ntfs格式磁盘的办法 简单粗暴
- 如何创建一个类只能在堆(栈)上建立对象
- JS-实现类似于高考倒计时的倒计时时差
- 实习日记(第二周)
- 图解Java多线程设计模式
- 专访阿里云异构计算负责人:异构计算,GPU、FPGA、ASIC芯片将三分天下
- 第七次面试