doubi6303 2016-10-10 10:32
浏览 19
已采纳

在对象阵列中查找最接近的日期/时间

I'm looking for some advise on what would be the best way to find the closest startTime (recommended startTime).

What I've got so far:

<?php
$array = array(    array("meeting_id" => "1812",  
                         "startTime" => "2016-10-07 14:30:00", 
                         "endTime" => "2016-10-07 14:35:00"),
                   array("meeting_id" => "1812",  
                         "startTime" => "2016-10-07 14:35:00", 
                         "endTime" => "2016-10-07 14:40:00"),
                   array("meeting_id" => "1812",  
                         "startTime" => "2016-10-07 14:40:00", 
                         "endTime" => "2016-10-07 14:45:00"),
                   array("meeting_id" => "1813",  
                         "startTime" => "2016-10-07 15:05:00", 
                         "endTime" => "2016-10-07 15:10:00"),
                   array("meeting_id" => "1813",  
                         "startTime" => "2016-10-07 15:10:00", 
                         "endTime" => "2016-10-07 15:15:00"),
                   array("meeting_id" => "1813",  
                         "startTime" => "2016-10-07 15:20:00", 
                         "endTime" => "2016-10-07 15:25:00"),
    );

arsort($array);
$firstTime = $array[0];
foreach($array as $key){
    if($firstTime["startTime"] > $key["endTime"]){
        // Do something in here.
    }
}

print_r($array);


?>

Printed Array:

Array
(
    [5] => Array
        (
            [meeting_id] => 1813
            [startTime] => 2016-10-07 15:20:00
            [endTime] => 2016-10-07 15:25:00
        )

    [4] => Array
        (
            [meeting_id] => 1813
            [startTime] => 2016-10-07 15:10:00
            [endTime] => 2016-10-07 15:15:00
        )

    [3] => Array
        (
            [meeting_id] => 1813
            [startTime] => 2016-10-07 15:05:00
            [endTime] => 2016-10-07 15:10:00
        )

    [2] => Array
        (
            [meeting_id] => 1812
            [startTime] => 2016-10-07 14:40:00
            [endTime] => 2016-10-07 14:45:00
        )

    [1] => Array
        (
            [meeting_id] => 1812
            [startTime] => 2016-10-07 14:35:00
            [endTime] => 2016-10-07 14:40:00
        )

    [0] => Array
        (
            [meeting_id] => 1812
            [startTime] => 2016-10-07 14:30:00
            [endTime] => 2016-10-07 14:35:00
        )

)

How I would expect it to work:

  • Find the earliest start time for meeting_id == 1812, and then find the closest next meeting whose ID != 1812. However the start time of those meeting ID != 1812 needs to be greater than the selected end time of 1812
  • 写回答

1条回答 默认 最新

  • douguan3470 2016-10-10 10:52
    关注

    The following function will take your array as the first argument, and the Meeting ID as the second, and will in turn return the nearest meeting to the earliest meeting whose ID is not $id:

    function get_nearest_meeting($meetings, $id)
    {
        // Start by sorting the meetings:
        function sorter($a, $b)
        {
            return strtotime($a['startTime']) - strtotime($b['startTime']);
        }
        usort($meetings, 'sorter');
    
        foreach( $meetings as $meeting )
        {
            if( $meeting['meeting_id'] == $id)
            {
                $earliest = strtotime( $meeting['endTime'] );
                break;
            }
        }
    
        // Now loop over again and get the next meeting:
        foreach( $meetings as $meeting )
        {
            if( $meeting['meeting_id'] != $id && strtotime($meeting['startTime']) > $earliest)
            {
                return $meeting;
            }
        }
    }
    

    Given the following input (stored in $meetings):

    Array
    (
        [0] => Array
            (
                [errors] => 0
                [meeting_id] => 1812
                [id] => 31305
                [startTime] => 2016-10-07 14:00:00
                [endTime] => 2016-10-07 14:10:00
                [grade_id] => 87
            )
    
        [1] => Array
            (
                [errors] => 0
                [meeting_id] => 1813
                [id] => 31305
                [startTime] => 2016-10-07 14:10:00
                [endTime] => 2016-10-07 14:20:00
                [grade_id] => 87
            )
    
        [2] => Array
            (
                [errors] => 0
                [meeting_id] => 1812
                [id] => 31305
                [startTime] => 2016-10-07 14:10:00
                [endTime] => 2016-10-07 14:20:00
                [grade_id] => 87
            )
    
        [3] => Array
            (
                [errors] => 0
                [meeting_id] => 1812
                [id] => 31305
                [startTime] => 2016-10-07 14:20:00
                [endTime] => 2016-10-07 14:30:00
                [grade_id] => 87
            )
    
        [4] => Array
            (
                [errors] => 0
                [meeting_id] => 1813
                [id] => 31305
                [startTime] => 2016-10-07 14:20:00
                [endTime] => 2016-10-07 14:30:00
                [grade_id] => 87
            )
    
        [5] => Array
            (
                [errors] => 0
                [meeting_id] => 1815
                [id] => 31305
                [startTime] => 2016-10-07 14:30:00
                [endTime] => 2016-10-07 14:40:00
                [grade_id] => 87
            )
    
        [6] => Array
            (
                [errors] => 0
                [meeting_id] => 1812
                [id] => 31305
                [startTime] => 2016-10-07 14:30:00
                [endTime] => 2016-10-07 14:40:00
                [grade_id] => 87
            )
    
        [7] => Array
            (
                [errors] => 0
                [meeting_id] => 1813
                [id] => 31305
                [startTime] => 2016-10-07 14:30:00
                [endTime] => 2016-10-07 14:40:00
                [grade_id] => 87
            )
    
        [8] => Array
            (
                [errors] => 0
                [meeting_id] => 1815
                [id] => 31305
                [startTime] => 2016-10-07 14:40:00
                [endTime] => 2016-10-07 14:50:00
                [grade_id] => 87
            )
    
        [9] => Array
            (
                [errors] => 0
                [meeting_id] => 1813
                [id] => 31305
                [startTime] => 2016-10-07 14:40:00
                [endTime] => 2016-10-07 14:50:00
                [grade_id] => 87
            )
    
    )
    

    And calling it like this:

    get_nearest_meeting($meetings, 1812);
    

    We end up with the following result:

    Array
    (
        [errors] => 0
        [meeting_id] => 1813
        [id] => 31305
        [startTime] => 2016-10-07 14:10:00
        [endTime] => 2016-10-07 14:20:00
        [grade_id] => 87
    )
    
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论

报告相同问题?

悬赏问题

  • ¥35 MIMO天线稀疏阵列排布问题
  • ¥60 用visual studio编写程序,利用间接平差求解水准网
  • ¥15 Llama如何调用shell或者Python
  • ¥20 谁能帮我挨个解读这个php语言编的代码什么意思?
  • ¥15 win10权限管理,限制普通用户使用删除功能
  • ¥15 minnio内存占用过大,内存没被回收(Windows环境)
  • ¥65 抖音咸鱼付款链接转码支付宝
  • ¥15 ubuntu22.04上安装ursim-3.15.8.106339遇到的问题
  • ¥15 blast算法(相关搜索:数据库)
  • ¥15 请问有人会紧聚焦相关的matlab知识嘛?