第三题比较简单,One small letter, surrounded by EXACTLY three big bodyguards on each of its sides. 即一个小写字母,两边各有不多不少的三个大写字母。 用正则表达式搞定。
import re
if __name__ == '__main__':
# put the mess from the page source into 3.txt
f = open('3.txt', 'r')
text = f.read()
list = re.findall('[^A-Z][A-Z]{3}[a-z][A-Z]{3}[^A-Z]', text)
print(''.join(x[4:5] for x in list))
f.close();
1 svn回退版本
1)在window中选择log,根据想要回退的内容,选择revert this version或revert chanages from this version
两者的区别:
revert this version:表示回退到当前版本(该版本后的版本全部作废)
revert chanages from this versio
<!--javascript取当月最后一天-->
<script language=javascript>
var current = new Date();
var year = current.getYear();
var month = current.getMonth();
showMonthLastDay(year, mont
public class MyStack {
private long[] arr;
private int top;
public MyStack() {
arr = new long[10];
top = -1;
}
public MyStack(int maxsize) {
arr = new long[maxsize];
top
Binary search needs an ordered array so that it can use array indexing to dramatically reduce the number of compares required for each search, using the classic and venerable binary search algori