UVa-10340
来源:互联网 发布:网络拓扑图图标素材包 编辑:程序博客网 时间:2024/06/05 09:56
You have devised a new encryption technique which encodes a message by inserting between its charactersrandomly generated strings in a clever way. Because of pending patent issues we will not discuss indetail how the strings are generated and inserted into the original message. To validate your method,however, it is necessary to write a program that checks if the message is really encoded in the finalstring.
Given two strings s and t, you have to decide whether s is a subsequence of t, i.e. if you can removecharacters from t such that the concatenation of the remaining characters is s.
Input
The input contains several testcases. Each is specified by two strings s, t of alphanumeric ASCIIcharacters separated by whitespace. Input is terminated by EOF.
Output
For each test case output, if s is a subsequence of t.
Sample Input
sequence subsequence
person compression
VERDI vivaVittorioEmanueleReDiItalia
caseDoesMatter CaseDoesMatter
Sample Output
Yes
No
Yes
No
思路:只要两字符串有相应的两字母匹配了,两字符串的索引就都加1
欢迎交流:
解法一:
#include<stdio.h>#include<string.h>char s[100005], t[100005];int main(){while (scanf("%s%s", s, t) !=EOF){int lens = strlen(s);int lent = strlen(t);int count = 0;int j = 0;for (int i = 0; i < lens; i++){for (; j < lent; j++)//不要在此处定义j,否则break后j又恢复为0{if (s[i] == t[j]){count++;j++;//一会break;后不会执行本for循环的j++break;}}}if (count == lens)printf("Yes\n");else printf("No\n");}return 0;}
参考:http://blog.csdn.net/mobius_strip/article/details/8225616
#include <iostream> #include <cstdlib> #include <cstring> using namespace std; char str[ 100005 ]; char val[ 100005 ]; int main() { while ( cin >> val >> str ) { int l1 = strlen(val); int l2 = strlen(str); if ( l1 > l2 ) { cout << "No" << endl; continue; } int s = 0; for ( int i = 0 ; i < l2 ; ++ i ) if ( val[s] == str[i] && s ++ == l1-1 )// val[s] == str[i]成立则执行s ++ == l1-1,否则不执行 break; if ( s == l1 ) cout << "Yes" << endl; else cout << "No" << endl; } return 0; }
- UVA 10340
- uva 10340
- UVA 10340
- UVA-10340
- UVa-10340
- UVA 10340
- UVA 10340
- uva 10340
- UVA 10340
- UVA 10340
- UVA 10340 (13.08.25)
- UVa 10340 子序列
- UVA 10340 子序列
- uva--10340+递归
- UVa 10340 字符串基础
- UVa 10340 子序列
- uva 10340 子序列
- UVa 10340 All inAll
- 使用Realm进行数据操作(二)
- 5-2 单词长度 (15分)
- 欧里几德及扩展欧里几德算法
- 51单片机定时器初值计算
- C++拷贝构造函数详解
- UVa-10340
- linux xargs传递参数
- Ubuntu14.04+GTX980 Ti+cuDNN 5.1
- 跟小博老师一起学Servlet ——Servlet之属性操作2
- PSPnet:Pyramid Scene Parsing Network
- opencv学习_6 (灰度直方图)
- Dlib编译与搭建
- C++-继承:构造函数和析构函数
- mysql数据库下行列转换笔记