Method and system for calculating delayed refund time for an ordering system during business hours

Abstract

The application provides a method and system for calculating the time of delayed refund of a meal ordering system during business hours, a circulating queue is constructed, the circulating queue comprises multiple nodes, each node represents a time, the business state of each node is identified, a distance value is given to each business node, and the distance value represents the time length from the business node to the next business node; the first business node after the time of the user's refund application is found in the circulating queue, the automatic refund delay time is converted into m time intervals; in the circulating queue, m business nodes are traversed from the first business node, the distance value of each traversed business node is obtained and accumulated, and the time of automatic refund of the meal ordering system is calculated according to the time of the user's refund application and the accumulated value. The business state of each time and the distance to the next business node are identified by constructing the circulating queue, and the time of automatic refund during business hours can be quickly calculated.

Description

TECHNICAL FIELD

[0001] The present application relates to the field of catering, more particularly, to a method and system for calculating a delayed refund time of an ordering system within business hours. BACKGROUND

[0002] For an ordering system, if a merchant does not process a user's after-sales refund application, the ordering system will automatically refund the user. Specifically, the ordering system sets a delay time for automatic refund. When the user applies for a refund request and the delay time set by the ordering system is over, the ordering system automatically refunds the user. For example, a user applies for a refund at 7:00 am, and the ordering system sets a 5-hour delay time for the refund. The ordering system will automatically refund the user at 12:00 pm.

[0003] This refund method does not take into account the business state of the merchant. For example, if the user applies for a refund at 7:00 am and the merchant starts business at 8:00 am, the 5-hour delay time for automatic refund includes the non-business time of the merchant. For another example, the refund time calculated according to the 5-hour delay time is 12:30 pm. At this time, the refund time is the non-business time of the merchant. When the system deducts the refund from the merchant's account, the merchant may not be able to check in time due to the non-business state, which may cause certain economic risks. SUMMARY

[0004] The present application provides a method and system for calculating a delayed refund time of an ordering system within business hours, which can quickly calculate the automatic refund time within business hours.

[0005] According to a first aspect of the present application, a method for calculating a delayed refund time of an ordering system within business hours is provided, comprising:

[0006] Step 1: Construct a circular queue, which records the business hours in a business cycle. The circular queue includes a plurality of nodes, each node represents a time, and the time interval between each two nodes is the same. Each node is identified. An identification of 0 indicates that the merchant is in a processing closed state at this time, and an identification of 1 indicates that the merchant is in a business state at this time. Each node with an identification of 1 is called a business node, and each node with an identification of 0 is called a non-business node. Each business node is assigned a distance value, which represents the time length from the business node to the next business node.

[0007] Step 2: Receive a user's refund application and obtain the user's refund application time.

[0008] Step 3: Find the first business node after the user's refund application time in the circular queue.

[0009] Step 4, convert the automatic refund delay time length of the ordering system into m time intervals, m is a positive integer;

[0010] Step 5, in the circular queue, traverse m business nodes backward from the starting business node, and obtain the distance value of each traversed business node;

[0011] Step 6, add the distance values of all traversed business nodes to obtain a distance addition value;

[0012] Step 7, calculate the automatic refund time of the ordering system according to the user refund application time and the distance addition value.

[0013] According to the second aspect of the present application, a calculation system for delaying the refund time of an ordering system within the business hours is provided, comprising:

[0014] A construction module is configured to construct a circular queue, which records the business hours within a business cycle. The circular queue includes a plurality of nodes, each of which represents a time. The time interval between each two nodes is the same. Each node is identified. An identification of 0 indicates that the merchant is in a closing state at the time, and an identification of 1 indicates that the merchant is in a business state at the time. The node with an identification of 1 is referred to as a business node, and the node with an identification of 0 is referred to as a non-business node. Each business node is assigned a distance value, which represents the time length from the business node to the next business node.

[0015] A receiving module is configured to receive the user's refund application and obtain the user's refund application time.

[0016] A searching module is configured to search for the first business node after the user's refund application time in the circular queue.

[0017] A conversion module is configured to convert the automatic refund delay time length of the ordering system into m time intervals, m is a positive integer;

[0018] A traversal module is configured to traverse m business nodes backward from the starting business node in the circular queue, and obtain the distance value of each traversed business node.

[0019] An addition module is configured to add the distance values of all traversed business nodes to obtain a distance addition value.

[0020] A calculation module is configured to calculate the automatic refund time of the ordering system according to the user refund application time and the distance addition value.

[0021] The application provides a method and system for calculating a delayed refund time in a business time of an ordering system. BRIEF DESCRIPTION OF DRAWINGS DETAILED DESCRIPTION OF THE INVENTION BRIEF DESCRIPTION OF DRAWINGS

[0022] Figure 1 A flow chart of a method for calculating a delayed refund time in a business time of an ordering system according to an embodiment of the application is provided.

[0023] Figure 2 A flow chart of constructing a circular queue according to business configuration data of a merchant according to an embodiment of the application is provided.

[0024] Figure 3 A structure block diagram of a system for calculating a delayed refund time in a business time of an ordering system according to an embodiment of the application is provided. DETAILED DESCRIPTION OF THE INVENTION

[0025] To make the objectives, technical solutions and advantages of the embodiments of the application clearer, the technical solutions in the embodiments of the application will be described below in detail with reference to the accompanying drawings. Obviously, the described embodiments are only some of the embodiments of the application, but not all the embodiments of the application. Based on the embodiments in the application, all the other embodiments obtained by those skilled in the art without creative work fall within the protection scope of the application. In addition, the technical features in each embodiment or in a single embodiment provided by the application can be combined with each other to form a feasible technical solution, and the combination is not restricted by the order of steps and / or structure mode, but should be based on the feasibility for those skilled in the art. When the combination of technical solutions appears contradictory or unfeasible, it should be considered that the combination of technical solutions does not exist and is not within the protection scope of the application.

[0026] Figure 1 A flow chart of a method for calculating a delayed refund time in a business time of an ordering system according to an embodiment of the application is provided, as shown in Figure 1 The method comprises the following steps:

[0027] Step 1, a cycle queue is constructed, which records the business time in a business cycle, and the cycle queue includes a plurality of nodes, each node represents a time, the time interval between each two nodes is the same, each node is identified, and the identification of 0 indicates that the merchant is in a closing state at the time, the identification of 1 indicates that the merchant is in a business state at the time, and the identification of 2 indicates that the time is an expected refund time, the node with the identification of 1 is marked as a business node, the node with the identification of 0 is marked as a non-business node, and the node with the identification of 2 is marked as a refund node, and each business node is assigned a distance value, which represents the time length of the business node to the next business node.

[0028] Understandably, first, a cycle queue is constructed, and the cycle queue is used to model the business time of a merchant in a cycle. In the embodiment of the present application, a cycle is a week. The time of a week is divided into a plurality of nodes, and each node represents a time. In the embodiment of the present application, one node represents one minute. Therefore, there are 7*24*60=10080 minutes in a week, corresponding to 10080 nodes in the cycle queue.

[0029] The business state of the merchant at each node in the cycle queue is identified, wherein the node identification of 0 indicates that the merchant is in a closing state at the time, the node identification of 1 indicates that the merchant is in a business state at the time, and the identification of 2 indicates that the time is an expected refund time. The node marked as 2 is referred to as a refund node, the node marked as 1 is referred to as a business node, and the node marked as 0 is referred to as a non-business node. Each business node is assigned a distance value, which represents the time length (time interval) of the current business node to the next business node.

[0030] In an embodiment of the present application, the step 1 of constructing the cycle queue includes:

[0031] Step 11, obtaining the business configuration data of the merchant of the ordering system, the business configuration data including the business date and business time period of the merchant in a business cycle, wherein a business cycle is a week, the business date is Monday to Sunday, and the business time period is the business time period of the merchant in each day.

[0032] Understandably, step 1 constructs the data structure of the cycle queue, and this step is based on the business configuration data of the merchant configured on the ordering system. The business configuration data mainly includes the business date and business time period of the merchant in a business cycle.

[0033] The business date configuration is represented by 1 for Monday, 2 for Tuesday, and so on, and each date is spliced together by “,”. For example, 1, 3, 4, 5, 6, 7 indicates that the merchant is open from Monday to Sunday, and closed on Tuesday.

[0034] Business time period configuration: time in the format of mm:ss, two times constitute a time period, connected by a "-" character, the system supports configuring multiple time periods, multiple time periods are spliced by ",". For example: 06:00-09:30, 11:30-14:00, 16:40-20:30, 22:00-01:30.

[0035] Step 12, according to the business date and the business time period, the business state of the merchant at each time interval is obtained by decomposition.

[0036] It can be understood that the business state of the merchant at each time interval is obtained by decomposition according to the pre-configured business date and business time period of the merchant. The configured business time period represents the time period when the merchant should be in the business state. The business time period is decomposed into each minute, and the business state of the merchant at each minute is 1.

[0037] Step 13, according to the business state of the merchant at each time interval obtained by decomposition, the business state of each node in the circular queue is identified to construct the circular queue.

[0038] In an embodiment of the present application, the step 13, according to the business state of the merchant at each time interval obtained by decomposition, the business state of each node in the circular queue is identified to construct the circular queue, comprising:

[0039] Step 131, the identification of each node in the circular queue is initialized to 0, and the business configuration data of the merchant is read.

[0040] It can be understood that when the circular queue is initialized, the identification of each node in the circular queue is initialized to 0, and then the business configuration data of the merchant is read.

[0041] Step 132, the business date and business time period configured in the business configuration data of the merchant are processed in a loop, and the offset of each time interval in the circular queue is calculated.

[0042] In an embodiment of the present application, step 132 specifically comprises:

[0043] Initialize the business date and business time of the first node in the circular queue;

[0044] According to the business time period, each business time is obtained;

[0045] The date offset between the business date of each business time and the business date of the first node is calculated, and the intra-day offset between each business time and the business time of the first node in the business date is calculated;

[0046] The date offset and the intra-day offset are added to obtain the offset of each business time in the circular queue.

[0047] Wherein, referring to Figure 2 , first, the business date and the business time of the first node in the circular queue are initialized, by default, the business date of the first node in the circular queue is Monday, and the business time is 0:00.

[0048] For each business time in the business time period, the date offset between the business date where each business time is located and the business date of the first node is calculated, and the intra-day offset between each business time and the business time of the first node in the business date is calculated. The date offset and the intra-day offset are added to obtain the offset between each business time and the business time of the first node.

[0049] Wherein, for example, the offset is calculated in minutes, the date offset between the business date where each business time is located and the business date of the first node includes:

[0050] offset1= ({week_num1} - 1) × 24 × 60;

[0051] Wherein, offset1 is the date offset, and week_num1 is the business date where each business time is located.

[0052] The intra-day offset between each business time and the business time of the first node in the business date includes:

[0053] offset2={current_hour1} × 60 + {current_minute1};

[0054] Wherein, offset2 is the intra-day offset, current_hour1 is the hour where each business time is located, and current_minute1 is the minute where each business time is located.

[0055] Wherein, the first node in the circular queue is set to Monday 0:00;

[0056] The date offset and the intra-day offset are added to obtain the offset of each business time in the circular queue, including:

[0057] offset =offset1+offset2;

[0058] Wherein, offset is the offset of each business time in the circular queue.

[0059] Step 133, according to the offset, locate the corresponding node in the circular queue, correspond the node to the represented time, and set the identification of the node to 1.

[0060] It can be understood that the offset between each business time and the business time of the first node is calculated, and the corresponding node in the circular queue is found according to the offset, for example, the offset between the current business time and the time of the first node is 1000, and the corresponding node of the current adaptive time in the circular queue is the 1001th node, and the identification of the 1001th node is set to 1, indicating that the node is a business node.

[0061] Step 134, sequentially process all times, and mark all business nodes in the circular queue as 1, and mark other nodes in the circular queue as 0.

[0062] It can be understood that each business time in the configured business time period of the merchant is processed, and the business state of all business nodes in the circular queue is marked. Specifically, the node corresponding to each business time in the business time of the merchant is marked as 1, and other nodes are marked as 0.

[0063] Step 2, receiving the user's refund application, and obtaining the user's refund application time.

[0064] Step 3, finding the first business node after the user's refund application time in the circular queue.

[0065] In an embodiment of the present application, when the user's application refund time is obtained, the offset between the user's application refund time and the first node in the circular queue is calculated:

[0066] offset ’= ({week_num2} - 1) × 24 × 60 + ({current_hour2} × 60 +{current_minute2});

[0067] Wherein, week_num2 is the business date of the user's application refund time, current_hour2 is the hour of the user's application refund time, current_minute2 is the minute of the user's application refund time, and the first node in the circular queue is set to Monday 0:00.

[0068] According to the offset between the user's application refund time and the first node in the circular queue, the node corresponding to the user's application refund time in the circular queue is found, and then the first business node after the node is found.

[0069] The time when the user applies for the refund request in the ordering system, that is, the time when the user applies for the refund, that is, the day of the week, the time, and the minute, the user applies for the refund request on the ordering system.

[0070] According to the time when the user applies for the refund, the first business node after the time when the user applies for the refund is found in the circular queue.

[0071] It should be noted that the time when the user applies for the refund may not be the business hours of the merchant, and in the embodiment of the application, the first business node after the time when the user applies for the refund is found in the circular queue. Among them, when the node corresponding to the time when the user applies for the refund is a business node, the business node is taken as the first business node; if the node corresponding to the time when the user applies for the refund is not a business node, the first business node after the node is found.

[0072] Step 4: Delay the automatic refund time of the ordering system into m time intervals, m is a positive integer.

[0073] Among them, the automatic refund delay time of the ordering system is determined according to the automatic refund delay time set by the ordering system and the user refund delay time correction amount.

[0074] Among them, the automatic refund delay time set by the ordering system is a fixed value n, and the user refund delay time correction amount c is determined according to the refund amount U and the user type R. The user type is a member user and a general user.

[0075] The calculation method of the user refund delay time correction amount c is as follows:

[0076] ;

[0077] ;

[0078] ;

[0079] Among them The floor function represents the user refund delay time correction amount corresponding to the refund amount U, and the user refund delay time correction amount corresponding to the user type R.

[0080] As can be seen from the above formula, the member type and the refund amount affect the correction amount of the refund time. The higher the amount, the longer the relative refund time, and the general user has a longer refund time than the member user. The maximum modification amount is not more than 7 hours in total.

[0081] It can be understood that the user applies for a refund in the ordering system, and the system automatically refunds for a delay time n, such as 4 hours, and combines the current correction amount c to obtain a comprehensive refund delay time, and is converted into m time intervals, as shown above, the time interval between every two nodes is 1 minute, and then the comprehensive refund delay time is converted into m minutes. Specifically,

[0082] m= (n+c) x 60;

[0083] Wherein, n is the automatic refund delay time set in the ordering system, and the unit is hour; c is the correction amount, and the unit is hour.

[0084] Step 5, in the circular queue, starting from the starting business node, traversing m business nodes backward, obtaining the distance value of each traversed business node.

[0085] It can be understood that the above step finds the first business node after the user applies for a refund and the m time intervals corresponding to the comprehensive refund delay time, and traverses m business nodes backward from the first business node in the circular queue, skips the non-business node, and obtains the distance value of each traversed business node.

[0086] Step 6, add the distance values of all traversed business nodes to obtain the distance addition value.

[0087] Step 7, according to the user refund application time and the distance addition value, calculate the automatic refund time of the ordering system.

[0088] Wherein, the distance value of each traversed business node is added to obtain the distance addition value, that is, the business time corresponding to the refund delay time. The user applies for a refund time and the distance addition value are added to obtain the automatic refund time of the ordering system.

[0089] It should be noted that in an embodiment of the present application, the business node corresponding to the automatic refund time is modified and marked as a refund node, and the distance value of the previous business node of the current refund node is modified as the original distance value plus the distance value of the current refund node.

[0090] In this way, the business node corresponding to the calculated automatic refund time is marked as a refund node. Since there are multiple user refund applications in the same minute, by this way, the business node can be temporarily modified as a refund node, and the next user can skip this refund node to avoid the problem of multiple refund requests in the same minute.

[0091] When the refund is completed, the refund node is automatically modified as a business node, and the distance value of the previous business node is updated, and the distance value of the previous business node is restored for the next user to apply for a refund.

[0092] Referring to Figure 3 The application further provides a computing system for delaying a refund time of a take-order system during business hours, comprising:

[0093] a constructing module 301, configured to construct a circular queue recording business hours in a business cycle, the circular queue comprising a plurality of nodes, each node representing a time, a time interval between each two nodes being the same, each node being identified, an identification of 0 indicating that the take-order system is in a closing state at the time, an identification of 1 indicating that the take-order system is in a business state at the time, a node with the identification of 1 being referred to as a business node, and a node with the identification of 0 being referred to as a non-business node, each business node being assigned a distance value, the distance value indicating a time length from the business node to a next business node;

[0094] a receiving module 302, configured to receive a refund application of a user and acquire a time of the refund application of the user;

[0095] a searching module 303, configured to search for a first business node after the time of the refund application of the user in the circular queue;

[0096] a converting module 304, configured to convert an automatic refund delay time of the take-order system into m time intervals, m being a positive integer;

[0097] a traversing module 305, configured to traverse m business nodes backward from the starting business node in the circular queue, and acquire a distance value of each traversed business node;

[0098] an accumulating module 306, configured to accumulate the distance values of all the traversed business nodes to obtain a distance accumulated value;

[0099] a computing module 307, configured to compute a refund time of the take-order system according to the time of the refund application of the user and the distance accumulated value.

[0100] It can be understood that the computing system for delaying a refund time of a take-order system during business hours provided by the application corresponds to the computing method for delaying a refund time of a take-order system during business hours provided by the above-mentioned embodiments, and the related technical features of the computing system for delaying a refund time of a take-order system during business hours can refer to the related technical features of the computing method for delaying a refund time of a take-order system during business hours, which will not be repeated here.

[0101] The point ordering system provided by the embodiment of the present application provides a method and system for calculating the delayed refund time within the business hours, the business state of each time is marked by constructing a circular queue, and a distance value is given to the business node, which represents the time length from the business node to the next business node, according to the time of user's application for refund, only the distance value of the business node after the time of user's application for refund needs to be searched in the circular queue, and the distance values are accumulated, so that the time of automatic refund within the business hours can be quickly calculated. By constructing the circular queue, the delayed time length of the refund is the delayed time length of the business hours of the merchant, and the time of automatic refund for the user within the business hours can be quickly calculated by excluding the non-business time of the business.

[0102] It should be noted that in the above embodiments, the description of each embodiment has its own emphasis, and the parts not described in detail in a certain embodiment can be referred to the related description of other embodiments.

[0103] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the present application can adopt a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can adopt the form of a computer program product implemented on one or more computer usable storage media containing computer usable program code (including but not limited to disk storage, CD-ROM, optical storage, etc.).

[0104] The present application is described with reference to flowcharts and / or block diagrams of the method, device (system), and computer program product according to the embodiments of the present application. It should be understood that each flow and / or block in the flowcharts and / or block diagrams, and the combination of the flows and / or blocks in the flowcharts and / or block diagrams can be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded computer, or other programmable data processing devices to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing devices produce a device that implements the flowcharts and / or block diagrams. Figure 1 The function specified in one flow or multiple flows and / or blocks. Figure 1 The device that implements the function specified in one block or multiple blocks.

[0105] These computer program instructions can also be stored in a computer readable storage medium that can guide the computer or other programmable data processing devices to work in a specific way, so that the instructions stored in the computer readable storage medium produce a product including instruction devices, which implement the flowcharts and / or block diagrams. Figure 1 The function specified in one flow or multiple flows and / or blocks. Figure 1 The device that implements the function specified in one block or multiple blocks.

[0106] These computer program instructions can also be loaded into a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart block or blocks. Figure 1 one or more flowcharts and / or blocks Figure 1 one or more flowcharts and / or blocks

[0107] Although preferred embodiments of the application have been described herein, substitutions and modifications of these preferred embodiments made by those skilled in the art who are familiar with the state of the art, to which the application pertains, are considered to be within the scope of the application. Accordingly, the attached claims are intended to embrace all such substitutions and modifications.

[0108] Obviously, numerous modifications and variations of the present application are possible in light of the above teachings. It is therefore to be understood that within the scope of the appended claims and their equivalents, the application can be practiced otherwise than as specifically described herein.

Claims

1. A method for calculating the delayed refund time during business hours in a food ordering system, characterized in that, The application comprises the following steps: Step 1, constructing a circular queue recording business hours in a business cycle, the circular queue comprising a plurality of nodes, each node representing a time, the time interval between each two nodes being the same, each node being identified, the identification of 0 indicating that the merchant is closed at the time, the identification of 1 indicating that the merchant is open at the time, the node with the identification of 1 being referred to as an open node, and the node with the identification of 0 being referred to as a non-open node, each open node being assigned a distance value, the distance value indicating the time length from the open node to the next open node; Step 2, receiving a user's refund application and obtaining the time of the user's refund application; Step 3, searching for the first open node after the time of the user's refund application in the circular queue; Step 4, converting the automatic refund delay time of the ordering system into m time intervals, m being a positive integer; Step 5, traversing m open nodes backward from the first open node in the circular queue and obtaining the distance value of each traversed open node; Step 6, adding up the distance values of all traversed open nodes to obtain a distance addition value; Step 7, calculating the time of the automatic refund of the ordering system according to the time of the user's refund application and the distance addition value.

2. The method of claim 1, wherein the time of the delayed refund is calculated during business hours. The step 1 of constructing a circular queue comprises the following steps: obtaining merchant business configuration data of an ordering system, the merchant business configuration data comprising business dates and business time periods of a merchant in a business cycle, wherein the business cycle is one week, the business dates are Monday to Sunday, and the business time periods are the business time periods of the merchant in each day; decomposing the business dates and the business time periods according to time intervals to obtain the business state of the merchant at each time; identifying the business state of each node in the circular queue according to the business state of the merchant at each time obtained by decomposition to construct the circular queue.

3. The method of claim 2, wherein the time of the delayed refund is calculated during business hours. The step of identifying the business state of each node in the circular queue according to the business state of the merchant at each time obtained by decomposition to construct the circular queue comprises the following steps: initializing the identification of each node in the circular queue to 0 and reading the merchant business configuration data; cyclically processing the business dates and the business time periods configured in the merchant business configuration data to calculate the offset of each time in the circular queue; positioning to the corresponding node in the circular queue according to the offset to correspond the node to the time represented by the node and setting the identification of the node to 1; processing all times in sequence, identifying all open nodes in the circular queue to 1, and identifying other nodes in the circular queue to 0.

4. The method of claim 3, wherein the time of the delayed refund is calculated during business hours. The step of cyclically processing the business dates and the business time periods configured in the merchant business configuration data to calculate the offset of each time in the circular queue comprises the following steps: initializing the business date and the business time of the first node in the circular queue; obtaining each business time according to the business time periods. calculating a date offset between the date of each business time and the date of the first node, and calculating an intra-day offset between each business time and the business time of the first node within the date of business; adding the date offset and the intra-day offset to obtain the offset of each business time in the circular queue.

5. The method of claim 4, wherein the time of the delayed refund is calculated during business hours. The time interval is 1 minute, and each node in the circular queue represents each minute.

6. The method of claim 5, wherein the time of the delayed refund is calculated during business hours. The calculation of the date offset between the date of each business time and the date of the first node comprises: offset1={ (week_num1) - 1}×24×60; Wherein, offset1 is the date offset, and week_num1 is the date of each business time; The calculation of the intra-day offset between each business time and the business time of the first node within the date of business comprises: offset2={current_hour1}×60 + {current_minute1}; Wherein, offset2 is the intra-day offset, current_hour1 is the hour of each business time, and current_minute1 is the minute of each business time; The first node in the circular queue is set to Monday 0:

00. The calculation of the date offset and the intra-day offset to obtain the offset of each business time in the circular queue comprises: offset = offset1+ offset2; Wherein, offset is the offset of each business time in the circular queue.

7. The method of claim 5, wherein the time of the delayed refund is calculated during business hours. The step 3 comprises: calculating the offset between the time of the user's refund application and the first node in the circular queue: Offset'={(week_num2)-1} × 24 × 60 + (current_hour2) × 60 + (current_minute2); Wherein, week_num2 is the date of the user's refund application, current_hour2 is the hour of the user's refund application, current_minute2 is the minute of the user's refund application, and the first node in the circular queue is set to Monday 0:00; According to the offset between the time of the user's refund application and the first node in the circular queue, find the corresponding node in the circular queue, and then find the first business node after the node; The step 4 comprises: m=(n+c)×60; Wherein, n is the automatic refund delay time length of the ordering system, and c is the user refund delay time length correction, which is in hours; Wherein, the user refund delay time length correction c is calculated according to the user's refund amount U and the user type R: ； ； ； wherein represents rounding down, f(U) represents a user refund delay duration correction amount corresponding to the refund amount U, and g(R) represents a user refund delay duration correction amount corresponding to the user type R.

8. A computing system for a point-of-sale system to delay a time of refund during business hours, the computing system comprising: comprises: The constructing module is configured to construct a circular queue, which records business hours in a business cycle, and the circular queue includes a plurality of nodes, each of which represents a time point, and a time interval between each two nodes is the same, and each node is identified, and an identification of 0 indicates that a merchant is in a closed state at the time point, and an identification of 1 indicates that the merchant is in a business state at the time point, a node with the identification of 1 is defined as a business node, and a node with the identification of 0 is defined as a non-business node, and each business node is assigned a distance value, and the distance value indicates a time length from the business node to a next business node; The receiving module is configured to receive a refund application of a user and acquire a user refund application time point; The searching module is configured to search for a first business node after the user refund application time point in the circular queue; The converting module is configured to convert an automatic refund delay time length of an ordering system into m time intervals, and m is a positive integer; The traversing module is configured to traverse m business nodes backward from the first business node in the circular queue, and acquire a distance value of each traversed business node; The accumulating module is configured to accumulate the distance values of all the traversed business nodes to obtain a distance accumulated value; The calculating module is configured to calculate an automatic refund time point of the ordering system according to the user refund application time point and the distance accumulated value.

Images