So when I said earlier that as soon as swap returns, all of the memory allocated for swap is now useless.
我前面指明的,一旦swap返回,所有为swap分配的内存都是无用的了。
You can brute force it and unfortunately, the so-called Caesar cipher is not very secure because if you assume, for our purposes in English alphabet with 26 characters, say all lowercase for all uppercase, my God, you only have to try like 24, 25, 26 possible rotations until you can figure out what his secret message is.
你可以强行解密但是不幸地是,所谓的凯撒密码不是很安全的,因为如果假设,对于我们的26个字符的字母表,指明所有的小写为大写,我的天,你只要试24,25次,26次就可以解答出,密文的内容。
And how about if the array is size N, and I say bracket N, where am I referring?
如果那个数组的大小为N,那会怎么样,我指明,涉及到了那个地方?
应用推荐