如下所示 给出2个解法
def euler_problem_18_1():
"""
this problem spend my half-day but noting to finished ,so bad
"""
rows = '''
3
7 4
2 4 6
100 5 9 3
'''
...
分类：
编程语言 时间：
2014-06-07 01:28:18
阅读次数：
261
title:
Largest palindrome product
Problem 4
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91
99.
Find the l...
分类：
其他好文 时间：
2014-06-07 01:24:27
阅读次数：
398
Problem Description:
Say you have an array for which the ith element is the price of a given stock on day i.
Design an algorithm to find the maximum profit. You may complete at most two transa...
分类：
其他好文 时间：
2014-06-05 09:33:52
阅读次数：
342
解决办法：
mysql> SET PASSWORD = PASSWORD('123456');
Query OK, 0 rows affected (0.03 sec)
mysql> create database roger;
Query OK, 1 row affected (0.00 sec)
也就是用mysql> SET PASSWORD = PASSWORD('123456...
分类：
数据库 时间：
2014-06-05 00:19:53
阅读次数：
294
??
Description
The country is facing a terrible civil war----cities in the country are divided into two parts supporting different leaders. As a merchant, Mr. M does not pay attention to politic...
分类：
其他好文 时间：
2014-06-05 00:16:43
阅读次数：
266
以下通过Simple Serial Interface进行设置，非扫描官方datasheet的设置条码....
分类：
其他好文 时间：
2014-06-03 05:03:16
阅读次数：
219
【题目】
Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x.
You should preserve the original relative order of the nodes in each of the two partitions.
For example,
Given 1->4->3-...
分类：
其他好文 时间：
2014-06-03 00:02:29
阅读次数：
270
分页bPaginite:true;是否启用分页功能sPaginationType:two_button 或者full_numbers
分页风格sFirst:告诉他第一页怎么写sLast:告诉他最后一页怎么写sNext:告诉他下一页怎么写sPrevious:告诉他上一页怎么写语言"sInfo":"共_...
分类：
Web程序 时间：
2014-05-31 20:58:59
阅读次数：
332
题目一：CombinationsGiven two integersnandk, return all
possible combinations ofknumbers out of 1 ...n.For example,Ifn= 4 andk= 2, a
solution is:[ [2,4],....
分类：
其他好文 时间：
2014-05-31 20:01:02
阅读次数：
455
Problem StatementIn the Republic of Nlogonia
there are N cities. For convenience, the cities are numbered 0 through N-1. For
each two different cities...
分类：
其他好文 时间：
2014-05-31 00:47:40
阅读次数：
364
