392. Is Subsequence (模拟)
来源:互联网 发布:美国 大数据公司 data 编辑:程序博客网 时间:2024/06/07 04:56
https://leetcode.com/problems/is-subsequence/description/
题目: 判断一个字符串是否是另一个字符串的前缀。
思路: l 表示s的下标,r表示t的下标,s[l]==t[r],l++,r++;否则r++。
刚开始加了特判,错了,后面发现有一个特殊输入 “ ”, “ ”。此时长度都为0.。。。。
class Solution {public: bool isSubsequence(string s, string t) { int len2=t.length(),len1=s.length(); int l=0,r=0; while(l<len1&&r<len2) { if(s[l]==t[r]) l++,r++; else r++; } return l==len1?1:0; }};
阅读全文
0 0
- 392. Is Subsequence (模拟)
- 392. Is Subsequence (greedy)
- LeetCode 392. Is Subsequence 题解(C++)
- 392. Is Subsequence (子序列判断)
- 392. Is Subsequence
- 392.[LeetCode] Is Subsequence
- 392. Is Subsequence
- 392. Is Subsequence
- LeetCode 392. Is Subsequence
- 392. Is Subsequence
- 392. Is Subsequence
- [LeetCode] 392. Is Subsequence
- 【leetcode】392. Is Subsequence
- 【LeetCode】392. Is Subsequence
- 【LeetCode】392. Is Subsequence
- 392. Is Subsequence
- 392. Is Subsequence
- Leetcode 392. Is Subsequence
- magent编译报错error: event.h: No such file or directory
- Linux驱动中的platform总线分析
- 二分查找(模板)
- C中变量的声明与定义
- c++调用静态库和动态库
- 392. Is Subsequence (模拟)
- 关于背包问题的一点点笔记(随时补充)
- PHP编程效率的20个要点
- 剑指offer(五)两个栈实现队列
- JavaWeb之JDBC(一)
- D
- 查找算法
- 线程基础:多任务处理——Fork/Join框架(排序算法性能补充)
- HDU 4722Good Numbers(数位dp)