Problem 11:Largest product in a grid

最新推荐文章于 2018-10-12 09:54:53 发布
最新推荐文章于 2018-10-12 09:54:53 发布
阅读量1k 收藏
点赞数
分类专栏： ProjectEuler 文章标签： ProjectEuler PHP
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/cfeibiao/article/details/9737529
版权

原题地址：http://projecteuler.net/problem=11

Largest product in a grid

Problem 11

In the 20×20 grid below, four numbers along a diagonal line have been marked in red.

08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48

The product of these numbers is 26 × 63 × 78 × 14 = 1788696.

What is the greatest product of four adjacent numbers in the same direction (up, down, left, right, or diagonally) in the 20×20 grid?


大意:

在以下这个20×20的网格中，四个处于同一对角线上的相邻数字用红色标了出来：

08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48

这四个数字的乘积是：26 × 63 × 78 × 14 = 1788696.

在这个20×20网格中，处于任何方向上（上，下，左，右或者对角线）的四个相邻数字的乘积的最大值是多少？


解法1：

1.遍历每一行，算出所有相邻4个数的乘积，并记录下最大乘积

2.遍历每一列，算出所有相邻4个数的乘积，并记录下最大乘积

3.遍历对角线，方向是\, 算出所有相邻4个数的乘积，并记录下最大乘积

4.遍历对角线，方向是/, 算出所有相邻4个数的乘积，并记录下最大乘积

php代码如下所示：

$data = array(
array("08", "02", "22", "97", "38", "15", "00", "40", "00", "75", "04", "05", "07", "78", "52", "12", "50", "77", "91", "08"),
array("49", "49", "99", "40", "17", "81", "18", "57", "60", "87", "17", "40", "98", "43", "69", "48", "04", "56", "62", "00"),
array("81", "49", "31", "73", "55", "79", "14", "29", "93", "71", "40", "67", "53", "88", "30", "03", "49", "13", "36", "65"),
array("52", "70", "95", "23", "04", "60", "11", "42", "69", "24", "68", "56", "01", "32", "56", "71", "37", "02", "36", "91"),
array("22", "31", "16", "71", "51", "67", "63", "89", "41", "92", "36", "54", "22", "40", "40", "28", "66", "33", "13", "80"),
array("24", "47", "32", "60", "99", "03", "45", "02", "44", "75", "33", "53", "78", "36", "84", "20", "35", "17", "12", "50"),
array("32", "98", "81", "28", "64", "23", "67", "10", "26", "38", "40", "67", "59", "54", "70", "66", "18", "38", "64", "70"),
array("67", "26", "20", "68", "02", "62", "12", "20", "95", "63", "94", "39", "63", "08", "40", "91", "66", "49", "94", "21"),
array("24", "55", "58", "05", "66", "73", "99", "26", "97", "17", "78", "78", "96", "83", "14", "88", "34", "89", "63", "72"),
array("21", "36", "23", "09", "75", "00", "76", "44", "20", "45", "35", "14", "00", "61", "33", "97", "34", "31", "33", "95"),
array("78", "17", "53", "28", "22", "75", "31", "67", "15", "94", "03", "80", "04", "62", "16", "14", "09", "53", "56", "92"),
array("16", "39", "05", "42", "96", "35", "31", "47", "55", "58", "88", "24", "00", "17", "54", "24", "36", "29", "85", "57"),
array("86", "56", "00", "48", "35", "71", "89", "07", "05", "44", "44", "37", "44", "60", "21", "58", "51", "54", "17", "58"),
array("19", "80", "81", "68", "05", "94", "47", "69", "28", "73", "92", "13", "86", "52", "17", "77", "04", "89", "55", "40"),
array("04", "52", "08", "83", "97", "35", "99", "16", "07", "97", "57", "32", "16", "26", "26", "79", "33", "27", "98", "66"),
array("88", "36", "68", "87", "57", "62", "20", "72", "03", "46", "33", "67", "46", "55", "12", "32", "63", "93", "53", "69"),
array("04", "42", "16", "73", "38", "25", "39", "11", "24", "94", "72", "18", "08", "46", "29", "32", "40", "62", "76", "36"),
array("20", "69", "36", "41", "72", "30", "23", "88", "34", "62", "99", "69", "82", "67", "59", "85", "74", "04", "36", "16"),
array("20", "73", "35", "29", "78", "31", "90", "01", "74", "31", "49", "71", "48", "86", "81", "16", "23", "57", "05", "54"),
array("01", "70", "54", "71", "83", "51", "54", "69", "16", "92", "33", "48", "61", "43", "52", "01", "89", "19", "67", "48"),
);
$hight = 20;
$width = 20;
$number_sequence_len = 4;
$max = 0;
$max_array = array();

function set_max($arr,&$max,&$max_array){
	$sum =  1;
	foreach($arr as $number){
		$sum *= $number;
	}
	if($sum>$max){
		$max = $sum;
		$max_array = $arr;
	}
}

$groups_of_row = $width-$number_sequence_len+1;
$groups_of_col = $hight-$number_sequence_len+1;
//行
for($i=0;$i<$hight;$i++){
	for($j=0;$j<$groups_of_row;$j++){
		$temp = array_slice($data[$i],$j,$number_sequence_len);
		set_max($temp,$max,$max_array);
	}
}
//列
for($i=0;$i<$width;$i++){
	for($j=0;$j<$groups_of_col;$j++){
		$temp = array();
		for($k=0;$k<$number_sequence_len;$k++){
			$temp[] = $data[$j+$k][$i];
		}
		set_max($temp,$max,$max_array);
	}
}
//对角：\
for($i=0;$i<$groups_of_col;$i++){
	for($j=0;$j<$groups_of_row;$j++){
		$temp = array();
		for($k=0;$k<$number_sequence_len;$k++){
			$temp[] = $data[$i+$k][$j+$k];
		}
		set_max($temp,$max,$max_array);
	}
	
}
//对角：/
for($i=0;$i<$groups_of_col;$i++){
	for($j=$number_sequence_len-1;$j<$width;$j++){
		$temp = array();
		for($k=0;$k<$number_sequence_len;$k++){
			$temp[] = $data[$i+$k][$j-$k];
		}
		set_max($temp,$max,$max_array);
	}
}
echo $max;




注：题目的中文翻译源自http://pe.spiritzhang.com

cfeibiao
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
ThoughtWorks-Problem one: Trains
06-22
"Problem one: Trains"是ThoughtWorks面试中可能遇到的一个问题，它涉及图形算法的解决。 首先，我们要理解这个问题的核心是图形算法。图形算法通常在计算机图形学中使用，用于处理图像数据，例如创建、操作或分析...
Largest product in a grid（ Project Euler problem 11）
07-17 119
In the 2020 grid below, four numbers along a diagonal line have been marked in red. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 0849 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 ...
Project Euler 题解 #11 Largest product in a grid
周平的专栏
09-27 1136
题目：Largest product in a grid In the 2020 grid below, four numbers along a diagonal line have been marked in red. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 49 49 99 40 17 81 18 5
Project Euler:Problem 11 Largest product in a grid
312小公举的专栏
05-30 879
In the 20×20 grid below, four numbers along a diagonal line have been marked in red. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56
Project Euler Problem 11 (C++和Python代码实现和解析)
jiafengfu的CSDN博客
10-12 332
Problem 11 : Largest product in a grid In the 20×20 grid below, four numbers along a diagonal line have been marked in red. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 49 49 99 40 17 8...
Problem 11 Largest product in a grid
junxinsiwo的专栏
07-21 353
Problem 11 Largest product in a grid In the 20×20 grid below, four numbers along a diagonal line have been marked in red. The product of these numbers is 26 × 63 × 78 × 14 = 1788696. What is the greatest product of four adjacent numbers in the same directi
Here are a few algorithmic problems for you to try: Problem 1:
最新发布
08-20
Given a sorted array of integers, write a function to find the first duplicate in the array. Example: input = [1, 2, 3, 4, 5, 2, 3] -> output = 2 Problem 3: Given a binary tree, write a function to...
洛谷题解：P1001-A+B Problem
04-16
洛谷题解：P1001-A+B Problem主要涉及到知识点包括C++程序设计基础、程序输入输出操作、C++标准库的使用、位运算和C++编译预处理指令。 1. C++程序设计基础： - C++是编译型语言，需要编译成机器语言后才能运行。 ...
Silverlight Recipes: A Problem-Solution Approach
01-12
### Silverlight Recipes: A Problem-Solution Approach #### 一、概述 《Silverlight Recipes: A Problem-Solution Approach》第二版是一本专为开发者提供实际解决方案的书籍，它聚焦于使用Microsoft Silverlight...
Aversiveness of teacher-chosen interventions and student problem characteristics: Is there a relationship?
06-29
Aversiveness of teacher-chosen interventions and student problem characteristics: Is there a relationship? Fragile X Syndrome 389 WECHSLER, D. (1958). The measurement and appraisal of adult ...
Problem 11 of What is the greatest product of four adjacent numbers
comkingfly
03-13 733
In the 2020 grid below, four numbers along a diagonal line have been marked in red. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 5
欧拉计划11-15题
weixin_34326558的博客
04-09 524
11、Largest product in a grid In the 2020 grid below, four numbers along a diagonal line have been marked in red. 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 0849 49 99 40 17 81 18 57 60...
Problem 17：Number letter counts
09-08 1336
原题链接：http://projecteuler.net/problem=17 If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total. If all the n
Problem 18：Maximum path sum I
09-08 1237
原题链接：http://projecteuler.net/problem=18 By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23. 3 7 4 2 4 6
Problem 12：Highly divisible triangular number
09-08 1111
原题链接：http://projecteuler.net/problem=12 The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The firs
Problem 20:Factorial digit sum
09-11 1097
原题链接：http://projecteuler.net/problem=20 n! means n  (n  1)  ...  3  2  1 For example, 10! = 10  9  ...  3  2  1 = 3628800, and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 +
Problem 3:Largest prime factor
08-01 1077
原文地址：http://projecteuler.net/problem=3 Largest prime factor Problem 3 The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ?
Problem 15：Lattice paths
09-08 1056
原题链接：http://projecteuler.net/problem=15 Starting in the top left corner of a 22 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.
SSL certificate problem: self signed certificate in certificate chain
04-07
This problem occurs when the SSL certificate presented by the server is not signed by a trusted certificate authority (CA). Instead, it is a self-signed certificate. This can happen for a variety of...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值