算法题1
来源:互联网 发布:莱特币源码分析 编辑:程序博客网 时间:2024/05/22 04:38
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, thenQ[i] = P[i-1] + P[i] + P[i+1] for all digit positionsi. 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 (using123210122 as an example):
- Assume P[0] = 0.
- Because Q[0] = P[0] + P[1] = 0 + P[1] = 1, we know that P[1] = 1.
- Because Q[1] = P[0] + P[1] + P[2] = 0 + 1 + P[2] = 2, we know that P[2] = 1.
- Because Q[2] = P[1] + P[2] + P[3] = 1 + 1 + P[3] = 3, we know that P[3] = 1.
- Repeating these steps gives us P[4] = 0, P[5] = 0, P[6] = 0,P[7] = 1, andP[8] = 1.
- We check our work by noting that Q[8] = P[7] + P[8] = 1 + 1 = 2. Since this equation works out, we are finished, and we have recovered one possible original string.
Now we repeat the process, assuming the opposite about P[0]:
- Assume P[0] = 1.
- Because Q[0] = P[0] + P[1] = 1 + P[1] = 0, we know that P[1] = 0.
- Because Q[1] = P[0] + P[1] + P[2] = 1 + 0 + P[2] = 2, we know that P[2] = 1.
- Now note that Q[2] = P[1] + P[2] + P[3] = 0 + 1 + P[3] = 3, which leads us to the conclusion thatP[3] = 2. However, this violates the fact that each character in the original string must be '0' or '1'. Therefore, there exists no such original stringP where the first digit is '1'.
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 vector <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
Class:BinaryCodeMethod:decodeParameters:stringReturns:vector <string>Method signature:vector <string> decode(string message)(be sure your method is public)Constraints
-message will contain between 1 and 50 characters, inclusive.-Each character in message will be either '0', '1', '2', or '3'.Examples
0)"123210122"
Returns: { "011100011", "NONE" }
The example from above.
1)"11"
Returns: { "01", "10" }
We know that one of the digits must be '1', and the other must be '0'. We return both cases.
2)"22111"
Returns: { "NONE", "11001" }
Since the first digit of the encrypted string is '2', the first two digits of the original string must be '1'. Our test fails when we try to assume thatP[0] = 0.
3)"123210120"
Returns: { "NONE", "NONE" }
This is the same as the first example, but the rightmost digit has been changed to something inconsistent with the rest of the original string. No solutions are possible.
4)"3"
Returns: { "NONE", "NONE" }5)
"12221112222221112221111111112221111"
Returns: { "01101001101101001101001001001101001", "10110010110110010110010010010110010" }
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.
我的code
#include<string>#include<vector>#include<iostream>using namespace std;class BinaryCode{public: BinaryCode(){}; ~BinaryCode(){}; vector<string> decode(string message){ int _length = message.size(); int reserve[255]; int result[255]; string resultStr; for(int i = 0;i < _length;i++){ reserve[i] = message[i] - '0'; } result[0] = 0; result[1] = reserve[0] - result[0]; for(int i = 2; i < _length ;i++){ result[i] = reserve[i-1] - result[i - 1] - result[i - 2]; } if(result[_length - 1] == reserve[_length - 1] - result[_length - 2]){ bool valid = true; for(int i = 0; i < _length; i++){ resultStr.push_back(result[i]+'0'); if(result[0] != 0 || result[1] != 1) valid = false; } if(valid) _result.push_back(resultStr); else _result.push_back("NONE"); } else _result.push_back(string("NONE")); resultStr.clear(); result[0] = 1; result[1] = reserve[0] - result[0]; for(int i = 2; i < _length ;i++){ result[i] = reserve[i-1] - result[i - 1] - result[i - 2]; } if(result[_length - 1] == reserve[_length - 1] - result[_length - 2]){ bool valid = true; for(int i = 0; i < _length; i++){ resultStr.push_back(result[i]+'0'); if(result[i] != 0 || result[i] != 1) valid = false; } _result.push_back(resultStr); } else _result.push_back(string("NONE")); return _result; }; private: vector<string> _result;};
- 机试算法题(1)--排序算法
- 面试算法题1
- 面试算法题1
- 算法题集1
- 算法题1
- 算法题1
- 趣味算法题(1)
- 算法题(1)
- 算法题集-1
- 面试算法题1
- 算法题(1)
- 递归算法题1
- 算法题(1)
- [算法]常见算法题
- 算法题/排序算法
- IT面试算法题(1)
- 笔试算法题(1)
- 算法题1+2+...+N
- 调试Android程序报错
- VS2005中,无法执行添加/移除操作,因为代码元素是只读的
- [C] C程序100例_016
- 电信:自娱自乐的全员揽装,让人心寒!
- 文本文件应用
- 算法题1
- Struts2学习笔记3_Struts2的加载执行解释
- 百度开放平台
- 通用新增(批量 实体)
- Linux下PostgreSQL安装与开机启动
- 单向链表C语言实现
- 搬家了
- 常见异常流量及蠕虫案例
- Android学习笔记(5)---模拟手机发送短信