文件的操作

python编码问题

在使用python时经常会遇到一些编码的错误

例如’gbk’ codec can’t decode byte 0xbe in position 18: illegal multibyte sequenc

生活

No matter what you do,the results will last

考完研以l后 过得有点丧

对未来不是很有把握

python函数嵌套

输出由1234组成的不同的三位数

Python 是强类型的动态脚本语言

好多人对python到底是强语言类型还是弱语言类型存在误解，其实，是否是强类型语言只需要一句话就可以判别，

第一次租房被坑 怎么说呢 心情复杂

字符数组转化成string类型

char ch [] = “ABCDEFG”;

string str(ch);//也可string str = ch;

或者

char ch [] = “ABCDEFG”;

string str;

str = ch;//在原有基础上添加可以用str += ch;

An inorder binary tree traversal can be implemented in a non-recursive way with a stack. For example, suppose that when a 6-node binary tree (with the keys numbered from 1 to 6) is traversed, the stack operations are: push(1); push(2); push(3); pop(); pop(); push(4); pop(); pop(); push(5); push(6); pop(); pop(). Then a unique binary tree (shown in Figure 1) can be generated from this sequence of operations. Your task is to give the postorder traversal sequence of this tree.

Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, …, N and pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence of the stack. For example, if M is 5 and N is 7, we can obtain 1, 2, 3, 4, 5, 6, 7 from the stack, but not 3, 2, 1, 7, 5, 6, 4.