php算法-饿了么面试

最新推荐文章于 2024-05-05 16:28:17 发布

qq_36207654

最新推荐文章于 2024-05-05 16:28:17 发布

阅读量222

点赞数

CC 4.0 BY-SA版权

文章标签：算法 php

本文链接：https://blog.youkuaiyun.com/qq_36207654/article/details/83994226

本文探讨了如何从日志文件中找出在一小时内访问量超过1000次的IP地址，以及使用冒泡排序算法筛选出访问量前100的IP地址的方法。通过对数据进行解析和处理，实现了对高频率访问的快速识别。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1、题目：a.log文件记录了全天24小时内访问的ip地址。计算任意一小时内访问量超过1000的ip地址。

$a=array(
0=>array(
“ip” => “127.0.0.0”,
“time” => “1”
),
1=>array(
“ip” => “127.0.0.0”,
“time” => “1”
),
2=>array(
“ip” => “127.0.0.0”,
“time” => “2”
),
3=>array(
“ip” => “127.0.0.1”,
“time” => “2”
),
4=>array(
“ip” => “127.0.0.1”,
“time” => “3”
),
5=>array(
“ip” => “127.0.0.2”,
“time” => “3”
),
);

$l e n g t h = c o u n t ($ a);
$num = array();
$r e s u l t = a r r a y (); f o r e a c h ($ a as $k e y = >$ value) {
if (isset( $r e s u l t [$ value[‘ip’]])) {
continue;
}
$n u m [$ value[‘ip’]] = 1;
if (isset( $a [$ key+1])) {
for ( $i =$ key+1; $i <$ length; $KaTeX parse error: Expected '}', got 'EOF' at end of input: \dots if ($ a[ $i] [^{'} t i m e^{'}] -$ value[‘time’]<3600) {
if ($value[‘ip’] == $a [$ i][‘ip’]) {
$n u m [$ value[‘ip’]] = $n u m [$ value[‘ip’]]+1;
}
// if ( $n u m [$ value[‘ip’]] >1000) {
// break;
// }
} else {
break;
}
}
if ( $n u m [$ value[‘ip’]]>1000) {
$r e s u l t [$ value[‘ip’]]= $n u m [$ value[‘ip’]];
}
}
unset( $KaTeX parse error: Expected 'EOF', got '}' at position 7: num); }̲ var_dump($ result);
var_dump($a);

2、题目：取出访问量前100的ip。

$b = array(
0 => array(
‘ip’ => ‘127.0.0.0’,
‘num’ => ‘3’,
),
1 => array(
‘ip’ => ‘127.0.0.1’,
‘num’ => ‘5’,
),
2 => array(
‘ip’ => ‘127.0.0.2’,
‘num’ => ‘9’,
),
3 => array(
‘ip’ => ‘127.0.0.3’,
‘num’ => ‘3’,
),
4 => array(
‘ip’ => ‘127.0.0.4’,
‘num’ => ‘1’,
),
5 => array(
‘ip’ => ‘127.0.0.5’,
‘num’ => ‘2’,
),
6 => array(
‘ip’ => ‘127.0.0.6’,
‘num’ => ‘7’,
),
7 => array(
‘ip’ => ‘127.0.0.7’,
‘num’ => ‘8’,
),
);
//冒泡算法取出访问量最高的100个ip

$l e n = c o u n t ($ b);
for ($i=0; $i <$ len-1; $KaTeX parse error: Expected '}', got 'EOF' at end of input: \dots是最大的数 for ($ j=0; $j <$ len-1- $i;$ j++) {
if ( $b [$ j][‘num’] > $b [$ j+1][‘num’]) {
$temp = $b [$ j];
$b [$ j] = $b [$ j+1];
$b [$ j+1] = $KaTeX parse error: Expected 'EOF', got '}' at position 15: temp; }̲ } //当大\dots$ i>100) {
break;
}
}
$result = array_slice($ b,-5);
var_dump( $b); var_dump($ result);