TopCoder SRMS 1 字符串处理问题 Java题解
内容导读
互联网集市收集整理的这篇技术教程文章主要介绍了TopCoder SRMS 1 字符串处理问题 Java题解，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含5175字，纯文字阅读大概需要8分钟。
内容图文
Problem Statement |
|||||||||||||
|
Let‘s say you have a binary string such as the following: 011100011 One way to encrypt this string is to add to each digit the sum of its adjacent digits. For example, the above string would become: 123210122 In particular, if P is the original string, and Q is the encrypted string, then Q[i] = P[i-1] + P[i] + P[i+1] for all digit positions i. Characters off the left and right edges of the string are treated as zeroes. An encrypted string given to you in this format can be decoded as follows (using 123210122 as an example):
Now we repeat the process, assuming the opposite about P[0]:
Note that this algorithm produces at most two decodings for any given encrypted string. There can never be more than one possible way to decode a string once the first binary digit is set. Given a String message, containing the encrypted string, return a String[] with exactly two elements. The first element should contain the decrypted string assuming the first character is ‘0‘; the second element should assume the first character is ‘1‘. If one of the tests fails, return the string "NONE" in its place. For the above example, you should return {"011100011", "NONE"}. |
|||||||||||||
Definition |
|||||||||||||
|
|||||||||||||
Limits |
|||||||||||||
|
|||||||||||||
Constraints |
|||||||||||||
| - | message will contain between 1 and 50 characters, inclusive. | ||||||||||||
| - | Each character in message will be either ‘0‘, ‘1‘, ‘2‘, or ‘3‘. | ||||||||||||
Examples |
|||||||||||||
| 0) | |||||||||||||
|
|||||||||||||
| 1) | |||||||||||||
|
|||||||||||||
| 2) | |||||||||||||
|
|||||||||||||
| 3) | |||||||||||||
|
|||||||||||||
| 4) | |||||||||||||
|
|||||||||||||
| 5) | |||||||||||||
|
|||||||||||||
This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2003, TopCoder, Inc. All rights reserved.
计算有多少种解密字符串，因为是01串，故此只能最多有两种了。
才第二次使用Java解题，会不会像是披着Java外壳的C++程序呢？
实际体会：
C++转Java倒真的不难，最大的难点就是要知道如何使用Java的一些函数，比如本题的string处理，如果使用C++自然是直接加或者使用VC的直接push_back，不过Java好像有个什么StringBuilder类，这里我直接+=接起来了。
故此C++转Java的问题实际上是记忆问题，不存在理解问题了，因为Java有的概念，C++差不多都有，理解障碍就没有了。
最后大家都熟悉的稍微有点争论的一个结论：只要熟悉一种语言，那么学其他语言就会很轻松了。
我个人是支持这个结论的。前提是要知道“熟悉”这两个字的分量。
看过两本C++经典书就说自己熟悉C++是不对的，就像看过算法导论就说自己懂算法也是不对的，需要大量的练习，思考，深刻地体会。
public class BinaryCode {
private boolean equ(int a, int b) {
return a == b;
}
public String[] decode(String ms) {
String rs[] = new String[2];
if (ms.isEmpty())
return rs;
rs[0] = getCode(ms, "0");
rs[1] = getCode(ms, "1");
//check the end bit
int n = rs[0].length();
int a = rs[0].charAt(n-1) - '0';
int b = n > 1? rs[0].charAt(n-2) - '0' : 0;
if (a + b + '0' != ms.charAt(ms.length()-1)) rs[0] = "NONE";
n = rs[1].length();
a = rs[1].charAt(n-1) - '0';
b = n > 1? rs[1].charAt(n-2) - '0' : 0;
if (a + b + '0' != ms.charAt(ms.length()-1)) rs[1] = "NONE";
return rs;
}
String getCode(String ms, String dec) {
int n = ms.length();
if (equ(1, n))
return dec;
dec += String.valueOf(ms.charAt(0) - dec.charAt(0));
//每次是计算i下标的下一个char，故此只需要循环到n-1就可以了
for (int i = 1; i < n - 1; i++) {
int a = dec.charAt(i - 1) - '0';
int b = dec.charAt(i) - '0';
int c = ms.charAt(i) - '0';
int d = c - a - b;
if (!equ(0, d) && !equ(1, d)) return "NONE";
dec += String.valueOf(d);
}
return dec;
}
}
public class Main {
public static void main(String[] args) {
BinaryCode bc = new BinaryCode();
String[] str = bc.decode("123210122");
System.out.print(str[0] + '\n' + str[1]);
}
}
原文：http://blog.csdn.net/kenden23/article/details/41147071
内容总结
以上是互联网集市为您收集整理的TopCoder SRMS 1 字符串处理问题 Java题解全部内容，希望文章能够帮你解决TopCoder SRMS 1 字符串处理问题 Java题解所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。
内容备注
版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。
内容手机端
扫描二维码推送至手机访问。