Method for determining number of times of continuous completion and related device

Abstract

The invention relates to the technical field of data processing, in particular to a method for determining the number of times of continuous completion and a related device, and aims to improve the calculation efficiency of the number of times of continuous completion. The method comprises the steps that in the process that a target object completes a continuous task, in response to a supplementary task triggered by the target object, a historical timestamp sequence generated based on the completed condition of the continuous task is acquired, and a to-be-inserted timestamp corresponding to the supplementary task is acquired; the historical timestamp sequence is traversed, after traversing is completed, the finally accumulated number of times of continuous completion of the target is output, and the following operation is executed every time the historical timestamp is read: if the currently read historical timestamp is not the target timestamp, the currently accumulated number of times of continuous completion of the target timestamp is updated; and if the historical timestamp is the target timestamp, taking the timestamp to be inserted as a new historical timestamp, inserting a target vacancy before the historical timestamp, and updating the current accumulated continuous completion times. In this way, only one-time traversal is needed, and the time complexity is reduced.

Description

Technical Field

[0001] The present application relates to the field of data processing technology, and in particular to a method for determining the number of consecutive completions and a related device. Background Art

[0002] At present, with the development of Internet technology, more and more offline activities are turning into online activities. Many online applications (Application, APP) have launched various types of continuous task activities. If the target object completes the target task of the continuous task activity, he can get corresponding rewards in the APP. If the target object's continuous task is interrupted, the target object can eliminate the interruption by completing supplementary tasks.

[0003] For example, in a daily sign-in activity, you can get rewards if you sign in for seven consecutive days. If you forget to sign in during the day, the target object can make up for the days you missed by completing specific actions, such as forwarding, browsing the web for 30 seconds, and other specific actions.

[0004] In the process of the target object completing the continuous task, when the target object triggers and completes the supplementary task, it is necessary to first obtain the historical timestamp sequence generated based on the completion status of the continuous task, and update the historical timestamp sequence based on the timestamp to be inserted corresponding to the supplementary task, calculate the latest number of consecutive completions, and then determine whether the number of consecutive task completions reaches the preset continuous number threshold, and distribute rewards to the target object.

[0005] In the prior art, when updating a historical timestamp sequence and calculating the latest number of consecutive completions, the historical timestamp sequence is usually traversed first to find the position where the timestamp to be inserted needs to be inserted, insert the timestamp to be inserted at that position, obtain the target timestamp sequence, and then traverse the target timestamp sequence again to calculate the latest number of consecutive completions and save it.

[0006] However, since updating the historical timestamp sequence and calculating the latest number of consecutive completions requires traversing the timestamp sequence twice, the time complexity is high, resulting in low efficiency.

[0007] In view of this, the calculation efficiency of the number of consecutive task completions under related technologies needs to be further improved. Summary of the invention

[0008] The embodiment of the present application provides a method for determining the number of consecutive completions and a related device to improve the calculation efficiency of the number of consecutive completions.

[0009] The specific technical solutions provided by the embodiments of this application are as follows:

[0010] In a first aspect, an embodiment of the present application provides a method for determining the number of consecutive completions, the method comprising:

[0011] In the process of the target object completing the continuous task, in response to the supplementary task triggered by the target object, a historical timestamp sequence generated based on the completion status of the continuous task is obtained, and a timestamp to be inserted corresponding to the supplementary task is obtained; wherein each historical timestamp corresponds to a completion status of the continuous task, and the historical timestamp sequence includes: a target vacancy corresponding to the supplementary task;

[0012] Traverse the historical timestamp sequence, and after the traversal is completed, output the final cumulative number of consecutive target completions. For each read, perform the following operations:

[0013] If the currently read historical timestamp is not the target timestamp, the current accumulated number of consecutive completions is updated. The target timestamp is: the first historical timestamp in the historical timestamp sequence that is later than the insertion timestamp;

[0014] If the historical timestamp is the target timestamp, the timestamp to be inserted is used as the new historical timestamp, inserted into the target space before the historical timestamp, and the current accumulated number of consecutive completions is updated.

[0015] In a second aspect, an embodiment of the present application further provides a device for determining the number of consecutive completions, the device comprising:

[0016] An acquisition module is used to acquire a historical timestamp sequence generated based on the completion status of the continuous tasks in response to the supplementary tasks triggered by the target object during the process of the target object completing the continuous tasks, and to acquire the to-be-inserted timestamps corresponding to the supplementary tasks; wherein each historical timestamp corresponds to a completion status of the continuous tasks, and the historical timestamp sequence includes: a target vacancy corresponding to the supplementary tasks;

[0017] The first processing module is used to traverse the historical timestamp sequence and output the final accumulated number of consecutive target completions after the traversal is completed. Each time the sequence is read, the following operations are performed:

[0018] If the currently read historical timestamp is not the target timestamp, the current accumulated number of consecutive completions is updated. The target timestamp is: the first historical timestamp in the historical timestamp sequence that is later than the insertion timestamp;

[0019] If the historical timestamp is the target timestamp, the timestamp to be inserted is used as the new historical timestamp, inserted into the target space before the historical timestamp, and the current accumulated number of consecutive completions is updated.

[0020] In a possible implementation, if the currently read historical timestamp is not the target timestamp, the currently accumulated number of consecutive completions is updated, and the first processing module is further used to:

[0021] If the currently read historical timestamp is not the target timestamp, and the historical timestamp is the first historical timestamp in the historical timestamp sequence, the currently accumulated number of consecutive completions is initialized to 1;

[0022] If the historical timestamp is not the target timestamp, and the historical timestamp is not the first historical timestamp, then based on the historical timestamp and the last historical timestamp read, determine the first continuous relationship between the historical timestamp and the last historical timestamp, and based on the first continuous relationship, update the current accumulated number of continuous completions.

[0023] In a possible implementation, when determining the continuous relationship between the historical timestamp and the last historical timestamp read based on the historical timestamp and the last historical timestamp read, the first processing module is further used to:

[0024] Based on the previous historical timestamp, determine the time period of the previous historical timestamp;

[0025] If the historical timestamp is within the time period between the end time of the time period and the end time of the next time period, determining that the first continuous relationship between the historical timestamp and the previous historical timestamp is continuous;

[0026] If the historical timestamp is not within the time period between the end time of the time period and the end time of the next period, it is determined that the first continuous relationship between the historical timestamp and the previous historical timestamp is discontinuous.

[0027] In a possible implementation, when the current accumulated number of consecutive completions is updated based on the first continuous relationship, the first processing module is further configured to:

[0028] If the first continuous relationship is continuous, then add 1 to the current accumulated number of continuous completions;

[0029] If the first continuous relationship is discontinuous, the current accumulated number of consecutive completions is reset to 1.

[0030] In a possible implementation, if the historical timestamp is the target timestamp, the timestamp to be inserted is used as the new historical timestamp, inserted into the target space before the historical timestamp, and the current accumulated number of consecutive completions is updated. The first processing module is further used for:

[0031] When the historical timestamp is the target timestamp, the timestamp to be inserted is used as the new historical timestamp and inserted into the target space before the historical timestamp;

[0032] If the historical timestamp is not the first historical timestamp in the historical timestamp sequence, the current accumulated continuous completion count is updated based on the second continuous relationship between the timestamp to be inserted and the last historical timestamp read, and the third continuous relationship between the timestamp to be inserted and the historical timestamp;

[0033] If the historical timestamp is the first historical timestamp in the historical timestamp sequence, the currently accumulated continuous completion times are updated based on the fourth continuous relationship between the timestamp to be inserted and the historical timestamp.

[0034] In a possible implementation, based on the second continuous relationship between the timestamp to be inserted and the last historical timestamp read, and the third continuous relationship between the timestamp to be inserted and the historical timestamp, when updating the current accumulated number of continuous completions, the first processing module is further used to:

[0035] If the second continuous relationship is continuous and the third continuous relationship is continuous, then add 2 to the current accumulated number of continuous completions;

[0036] If the second continuous relationship is discontinuous and the third continuous relationship is continuous, the current accumulated number of consecutive completions is set to 2;

[0037] If the second continuous relationship is discontinuous and the third continuous relationship is discontinuous, the current accumulated number of continuous completions is set to 1, and 1 is used as the number of continuous completions corresponding to the timestamp to be inserted;

[0038] If the second continuous relationship is continuous and the third continuous relationship is discontinuous, the current accumulated continuous completion count is increased by 1 as the continuous completion count corresponding to the time stamp to be inserted, and the current accumulated continuous completion count is set to 1.

[0039] In a possible implementation, when updating the current accumulated number of consecutive completions based on the fourth continuous relationship between the time stamp to be inserted and the historical time stamp, the first processing module is further configured to:

[0040] If the fourth continuous relationship is continuous, the current accumulated number of consecutive completions is set to 2;

[0041] If the fourth continuous relationship is discontinuous, the current accumulated number of continuous completions is set to 1, and 1 is used as the number of continuous completions corresponding to the timestamp to be inserted.

[0042] In a possible implementation, when traversing the historical timestamp sequence and outputting the final accumulated number of consecutive target completions after the traversal is completed, the first processing module is further used to:

[0043] The current accumulated continuous completion times after the last reading is used as the final accumulated target continuous times and output;

[0044] If the continuity relationship between the target timestamp and the timestamp to be inserted is continuous, and there is no reset timestamp in the historical timestamp sequence, then the target continuous completion count is used as the continuous completion count corresponding to the timestamp to be inserted, and the reset timestamp is: the historical timestamp in the historical timestamp sequence that is after the target timestamp and is discontinuous with the previous historical timestamp;

[0045] If the continuity relationship between the target timestamp and the timestamp to be inserted is continuous, and there is a reset timestamp in the historical timestamp sequence, the current accumulated continuous completion count corresponding to the previous historical timestamp of the reset timestamp will be used as the continuous completion count corresponding to the timestamp to be inserted.

[0046] In a possible implementation, after traversing the historical timestamp sequence and outputting the final accumulated number of consecutive target completions after the traversal is completed, the device further includes a second processing module, the second processing module being configured to:

[0047] After the traversal is completed, if the timestamp to be inserted has not been inserted into the historical timestamp sequence, the timestamp to be inserted is inserted into the target empty position after the last historical timestamp included in the historical timestamp sequence;

[0048] Based on the fifth continuous relationship between the timestamp to be inserted and the last historical timestamp, the target continuous completion count is updated, and the updated target continuous completion count is used as the continuous completion count corresponding to the timestamp to be inserted;

[0049] Add 1 to the cumulative number of completions corresponding to the consecutive tasks and output each completion number.

[0050] In a third aspect, an embodiment of the present application further provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein when the processor executes the program, the steps of any one of the above-mentioned methods for determining the number of consecutive completions are implemented.

[0051] In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of any of the above-mentioned methods for determining the number of consecutive completions.

[0052] In a fifth aspect, an embodiment of the present application further provides a computer program product, including computer instructions, which are executed by a processor to perform the steps of any of the above-mentioned methods for determining the number of consecutive completions.

[0053] The beneficial effects of this application are as follows:

[0054] In an embodiment of the present application, during the process of the target object completing a continuous task, in response to the supplementary task triggered by the target object, a historical timestamp sequence generated based on the completion status of the continuous task is obtained, and the timestamp to be inserted corresponding to the supplementary task is obtained, and then the historical timestamp sequence is traversed to find the target space where the timestamp to be inserted needs to be inserted, and the current accumulated number of continuous completions is updated in real time. After the traversal is completed, the final accumulated target number of continuous completions is output.

[0055] In this way, the historical timestamp sequence is traversed once to find the target space where the timestamp needs to be inserted. During each reading process, the current cumulative number of consecutive completions is updated. Only the historical timestamp sequence needs to be traversed once to update the historical timestamp sequence and output the final cumulative target consecutive completion times, which reduces the time complexity and improves the execution efficiency of updating the historical timestamp sequence and calculating the latest consecutive completion times. BRIEF DESCRIPTION OF THE DRAWINGS

[0056] Figure 1 This is an optional schematic diagram of an application scenario in an embodiment of the present application;

[0057] Figure 2 This is a first implementation flow chart of a method for determining the number of times a continuous task is completed in an embodiment of the present application;

[0058] Figure 3 A schematic diagram of a historical timestamp sequence and a timestamp to be inserted in an embodiment of the present application;

[0059] Figure 4 This is a schematic diagram of a first process of traversing a historical timestamp sequence in an embodiment of the present application;

[0060] Figure 5 A first flow chart of updating the current accumulated number of consecutive completions in an embodiment of the present application;

[0061] Figure 6 A first schematic diagram of updating the current accumulated number of consecutive completions in an embodiment of the present application;

[0062] Figure 7 A schematic diagram of a process for determining a continuous relationship between two historical timestamps in an embodiment of the present application;

[0063] Figure 8 A second flow chart of updating the current accumulated number of consecutive completions in an embodiment of the present application;

[0064] Fig.9A A second schematic diagram of updating the current accumulated number of consecutive completions in an embodiment of the present application;

[0065] Fig. 9BA third schematic diagram of updating the current accumulated number of consecutive completions in an embodiment of the present application;

[0066] Fig.10 A third flow chart of updating the current accumulated number of consecutive completions in an embodiment of the present application;

[0067] Fig.11 A fourth flow chart of updating the current accumulated number of consecutive completions in an embodiment of the present application;

[0068] Fig. 12A A fourth schematic diagram of updating the current accumulated number of consecutive completions in an embodiment of the present application;

[0069] Fig. 12B A fifth schematic diagram of updating the current accumulated number of consecutive completions in an embodiment of the present application;

[0070] Fig.13 A fifth flow chart of updating the current accumulated number of consecutive completions in an embodiment of the present application;

[0071] Fig.14A A sixth schematic diagram of updating the current accumulated number of consecutive completions in an embodiment of the present application;

[0072] Fig. 14B A seventh schematic diagram of updating the current accumulated number of consecutive completions in an embodiment of the present application;

[0073] Fig. 14C An eighth schematic diagram of updating the current accumulated number of consecutive completions in an embodiment of the present application;

[0074] Fig.14D A ninth schematic diagram of updating the current accumulated number of consecutive completions in an embodiment of the present application;

[0075] Fig.15 A first flow chart of outputting the final accumulated number of consecutive completions of a target in an embodiment of the present application;

[0076] Fig.16A This is a first schematic diagram of determining the number of consecutive completions corresponding to the timestamp to be inserted in an embodiment of the present application;

[0077] Fig. 16B A second schematic diagram of determining the number of consecutive completions corresponding to the timestamp to be inserted in the embodiment of the present application;

[0078] Fig.17 A second flow chart of outputting the final accumulated number of consecutive completions of a target in an embodiment of the present application;

[0079] Fig.18A A third schematic diagram of determining the number of consecutive completions corresponding to the time stamp to be inserted in an embodiment of the present application;

[0080] Fig.18B This is a fourth schematic diagram of determining the number of consecutive completions corresponding to the time stamp to be inserted in an embodiment of the present application;

[0081] Fig.19 This is a schematic diagram of a second process of traversing a historical timestamp sequence in an embodiment of the present application;

[0082] Fig. 20 A third implementation flow chart of a method for determining the number of consecutive task completions provided in an embodiment of the present application;

[0083] Fig.21 This is a schematic diagram of a scenario in which interruption elimination is not allowed in an embodiment of the present application;

[0084] Fig. 22 A schematic diagram of the structure of a device for determining the number of consecutive completions provided in an embodiment of the present application;

[0085] Fig.23 A schematic diagram of a hardware structure of a computer device in an embodiment of the present application;

[0086] Fig.24 A schematic diagram of the hardware composition structure of another computer device in an embodiment of the present application. DETAILED DESCRIPTION

[0087] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0088] To facilitate understanding of the technical solutions provided in the embodiments of the present application, some key terms used in the embodiments of the present application are explained here:

[0089] Consecutive completion times: refers to the number of consecutive time periods in which the task has been completed. If a task is completed once within a time period, the time period is marked as a completed task. The time period can be days, hours, weeks, etc. For example, if the time period is days, the consecutive completion times refers to the number of consecutive days in which the task has been completed.

[0090] Cumulative completion times: refers to the total number of time cycles for completed tasks.

[0091] Timestamp to be inserted: The timestamp that the target object wants to insert into the historical timestamp sequence.

[0092] The following is a brief introduction to the design concept of the embodiment of the present application:

[0093] At present, with the development of Internet technology, more and more offline activities are turning into online activities. Many online applications (Application, APP) have launched various types of continuous task activities. If the target object completes the target task of the continuous task activity, he can get corresponding rewards in the APP. If the target object's continuous task is interrupted, the target object can eliminate the interruption by completing supplementary tasks.

[0094] For example, in a daily sign-in activity, you can get rewards if you sign in for seven consecutive days. If you forget to sign in during the day, the target object can make up for the days you missed by completing specific actions, such as forwarding, browsing the web for 30 seconds, and other specific actions.

[0095] For another example, in a daily game login activity, players can get rewards by logging in for seven consecutive days. If players forget to log in during the activity, the target object can make up for the missed days by using preset virtual resources.

[0096] In the process of the target object completing the continuous task, when the target object triggers and completes the supplementary task, it is necessary to first obtain the historical timestamp sequence generated based on the completion status of the continuous task, and update the historical timestamp sequence based on the timestamp to be inserted corresponding to the supplementary task, calculate the latest number of consecutive completions, and then determine whether the number of consecutive task completions reaches the preset continuous number threshold, and distribute rewards to the target object.

[0097] In the prior art, when updating the historical timestamp sequence and calculating the latest number of consecutive completions, the following two methods are usually used:

[0098] Method 1: First traverse the historical timestamp sequence, find the position where the timestamp to be inserted needs to be inserted, insert the timestamp to be inserted at this position, obtain the target timestamp sequence, traverse the target timestamp sequence again, calculate the latest number of consecutive completions and save it.

[0099] Method 2: Read the historical timestamp sequence through binary search, find the position where the timestamp to be inserted needs to be inserted, insert the timestamp to be inserted at this position, obtain the target timestamp sequence, traverse the target timestamp sequence again, calculate the latest number of consecutive completions and save it.

[0100] However, since updating the historical timestamp sequence and calculating the latest number of consecutive completions requires traversing the timestamp sequence more than once, the time complexity is high, resulting in low efficiency.

[0101] In view of this, in an embodiment of the present application, a method for determining the number of times a continuous task is completed and a related device are provided. In the process of a target object completing a continuous task, in response to a supplementary task triggered by the target object, a historical timestamp sequence generated based on the completion status of the continuous task is obtained, and a timestamp to be inserted corresponding to the supplementary task is obtained, the historical timestamp sequence is traversed, and after the traversal is completed, the final accumulated target number of continuous completions is output, wherein each time the historical timestamp read is read, it is determined whether the historical timestamp currently read is the target timestamp. If the historical timestamp currently read is not the target timestamp, the currently accumulated number of continuous completions is updated. If the historical timestamp is the target timestamp, the timestamp to be inserted is used as the new historical timestamp, inserted into the target space before the historical timestamp, and the currently accumulated number of continuous completions is updated.

[0102] In this way, the historical timestamp sequence is traversed once to find the target vacancy where the timestamp to be inserted needs to be inserted. During each reading process, the current cumulative number of consecutive completions is updated. Only the historical timestamp sequence needs to be traversed once to update the historical timestamp sequence and output the final cumulative target consecutive completion times, which reduces the time complexity and can process historical timestamp sequences of any length, with good scalability. Moreover, not only the final cumulative target consecutive completion times can be output, but also the consecutive completion times corresponding to the timestamp to be inserted can be output, which is highly practical.

[0103] The preferred embodiments of the present application are described below in conjunction with the drawings in the specification. It should be understood that the preferred embodiments described herein are only used to illustrate and explain the present application, and are not used to limit the present application. In addition, the embodiments of the present application and the features in the embodiments may be combined with each other if there is no conflict.

[0104] See also Figure 1 , which is a schematic diagram of possible application scenarios in the embodiments of the present application. The application scenario diagram includes a server 110 and terminal devices 120 (including terminal devices 1201, 1202, ..., 120n).

[0105] The server 110 may be an independent physical server, or a server cluster or distributed system composed of multiple physical servers, or a cloud server that provides basic cloud computing services such as cloud services, cloud databases, cloud computing, cloud functions, cloud storage, network services, cloud communications, middleware services, domain name services, security services, content delivery networks (CDN), and big data and artificial intelligence platforms. The terminal device 120 and the server 110 may be directly or indirectly connected via wired or wireless communication, which is not limited in this application.

[0106] The terminal device 120 includes but is not limited to mobile phones, tablet computers, laptops, desktop computers, e-book readers, intelligent voice interaction devices, smart home appliances, car terminals and other devices; various software can be installed on the terminal device, such as applications and applets.

[0107] It should be noted that Figure 1 The figure is only an example. In fact, the number of terminal devices 120 and servers 110 is not limited and is not specifically limited in the embodiments of the present application.

[0108] It should be noted that the method for determining the number of consecutive task completions in the embodiment of the present application can be deployed in a computing device, which can be a server or a terminal device, wherein the server can be Figure 1 The server 110 shown in FIG. 1 may also be Figure 1 Other servers other than the server 110 shown in FIG. 1 ; the terminal device may be Figure 1 The terminal device 120 shown in FIG. 1 may also be Figure 1 Other terminal devices other than the terminal device 120 shown in FIG. That is, the method can be executed by a server or a terminal device alone, or by a server and a terminal device together.

[0109] When the terminal device executes alone, for example, the terminal device can respond to the supplementary task triggered by the target object, obtain the historical timestamp sequence generated based on the completion status of the continuous task, and obtain the timestamp to be inserted corresponding to the supplementary task, traverse the historical timestamp sequence, and insert the timestamp to be inserted into the target space corresponding to the supplementary task. During each reading process, the current accumulated number of consecutive completions is updated in real time, and after the traversal is completed, the final accumulated target continuous completion number is output.

[0110] When the server executes alone, for example, the server can respond to the supplementary task triggered by the target object, obtain the historical timestamp sequence generated based on the completion status of the continuous task, and obtain the timestamp to be inserted corresponding to the supplementary task, traverse the historical timestamp sequence, and insert the timestamp to be inserted into the target space corresponding to the supplementary task. During each reading process, the current accumulated number of consecutive completions is updated in real time, and after the traversal is completed, the final accumulated target continuous completion number is output.

[0111] When the server and the terminal device execute together, for example, the terminal device can respond to the supplementary task triggered by the target object, obtain a historical timestamp sequence generated based on the completion status of the continuous task, and obtain the timestamp to be inserted corresponding to the supplementary task; then, the terminal device transmits the obtained historical timestamp sequence and the timestamp to be inserted to the server, and the server traverses the historical timestamp sequence and inserts the timestamp to be inserted into the target space corresponding to the supplementary task. During each reading process, the server updates the current accumulated number of consecutive completions in real time, and outputs the final accumulated target number of consecutive completions after the traversal is completed.

[0112] The following describes the method for determining the number of consecutive completions provided by an exemplary embodiment of the present application in combination with the application scenarios described above and with reference to the accompanying drawings. It should be noted that the above application scenarios are only shown to facilitate understanding of the spirit and principles of the present application, and the implementation methods of the present application are not limited in this regard.

[0113] See also Figure 2 As shown, it is a first implementation flow chart of a method for determining the number of consecutive task completions provided in an embodiment of the present application. Here, the server is used as an example for the execution subject. The specific implementation process of the method is as follows:

[0114] Step 20: In the process of the target object completing the continuous task, in response to the supplementary task triggered by the target object, a historical timestamp sequence generated based on the completion status of the continuous task is obtained, and a timestamp to be inserted corresponding to the supplementary task is obtained.

[0115] Each historical timestamp corresponds to a completion of a continuous task, and the historical timestamp sequence includes: a target vacancy corresponding to a supplementary task.

[0116] In an embodiment of the present application, when the target object completes the supplementary task and fills the target vacancy corresponding to the supplementary task, the server responds to the supplementary task triggered by the target object, obtains a historical timestamp sequence generated based on the completion status of continuous tasks, and obtains the timestamp to be inserted corresponding to the supplementary task.

[0117] The supplementary tasks may be specific actions, such as forwarding and browsing web pages.

[0118] For example, see Figure 3As shown, it is a schematic diagram of a historical timestamp sequence and a timestamp to be inserted in an embodiment of the present application. Assuming that the time period of the continuous task is days, the completion status of the continuous tasks is: completed on June 18, 2025, completed on June 19, 2025, not completed on June 20, 2025, not completed on June 21, 2025, completed on June 22, 2025, and completed on June 23, 2025. The target object completes the supplementary task, and the target vacancy corresponding to the supplementary task is supplemented. The historical timestamp sequence generated based on the completion status of the continuous tasks is obtained as follows: {2025-06-18 09:59:45, 2025-06-19 10:45:45, 2025-06-22 09:59:45, 2025-06-23 16:30:35}, and obtain the timestamp to be inserted corresponding to the supplementary task, which is 2025-06-21 18:14:03.

[0119] Step 21: Traverse the historical timestamp sequence, and after the traversal is completed, output the final accumulated number of consecutive completions of the target.

[0120] Each time the data is read, the server performs the following operations. Figure 4 As shown, it is a first flow chart of traversing the historical timestamp sequence in the embodiment of the present application. Figure 4 , and explain in detail the specific operations performed:

[0121] Step 210: Determine whether the currently read historical timestamp is the target timestamp, if not, execute step 211, if yes, execute step 212.

[0122] The target timestamp is: the first historical timestamp in the historical timestamp sequence that is later than the insertion timestamp.

[0123] Step 211: Update the current accumulated number of consecutive completions.

[0124] In an embodiment of the present application, the currently read historical timestamp is compared with the timestamp to be inserted to determine whether the currently read historical timestamp is the target timestamp. When the historical timestamp is not the target timestamp, the current accumulated number of consecutive completions is updated.

[0125] For example, suppose the historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-22 09:59:45, 2025-06-23 16:30:35}, the historical timestamp currently read is 2025-06-18 09:59:45, and the timestamp to be inserted is 2025-06-21 18:14:03. 2025-06-18 09:59:45 is earlier than the timestamp to be inserted. Therefore, the historical timestamp 2025-06-18 09:59:45 is not the target timestamp.

[0126] For another example, the historical timestamp currently read is 2025-06-23 16:30:35, the timestamp to be inserted is 2025-06-21 18:14:03, the historical timestamp 2025-06-22 09:59:45 is the first historical timestamp later than the timestamp to be inserted, and the historical timestamp 2025-06-23 16:30:35 is the second historical timestamp later than the timestamp to be inserted. Then the historical timestamp 2025-06-23 16:30:35 currently read is not the target timestamp.

[0127] Specifically, when executing step 211 and updating the current accumulated number of consecutive completions, the server specifically performs the following operations. Figure 5 As shown, it is a first flow chart of updating the current accumulated number of consecutive completions in the embodiment of the present application. Figure 5 , and explain in detail the specific operations performed:

[0128] Step 2110: Determine whether the historical timestamp is the first historical timestamp in the historical timestamp sequence, if so, execute step 2111, otherwise, execute step 2112.

[0129] Step 2111: Initialize the current accumulated number of consecutive completions to 1.

[0130] In an embodiment of the present application, when the currently read historical timestamp is not the target timestamp, it is determined whether the historical timestamp is the first historical timestamp in the historical timestamp sequence. When the historical timestamp is the first historical timestamp in the historical timestamp sequence, the current accumulated number of consecutive completions is initialized to 1.

[0131] For example, see Figure 6As shown, this is the first schematic diagram of updating the current accumulated number of consecutive completions in an embodiment of the present application. Assuming that the historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-19 10:45:45, 2025-06-23 16:30:35}, the historical timestamp currently read is 2025-06-18 09:59:45, and the timestamp to be inserted is 2025-06-21 18:14:03. The historical timestamp 2025-06-18 09:59:45 is not the target timestamp, and is the first historical timestamp in the historical timestamp sequence, then the current accumulated number of consecutive completions is initialized to 1.

[0132] Step 2112: Based on the historical timestamp and the read last historical timestamp, determine a first continuous relationship between the historical timestamp and the last historical timestamp, and based on the first continuous relationship, update the current accumulated number of continuous completions.

[0133] In an embodiment of the present application, when the currently read historical timestamp is not the target timestamp, it is determined whether the historical timestamp is the first historical timestamp in the historical timestamp sequence. When the historical timestamp is not the first historical timestamp in the historical timestamp sequence, based on the historical timestamp and the last historical timestamp read, the first continuous relationship between the historical timestamp and the last historical timestamp is determined, and based on the first continuous relationship, the currently accumulated number of continuous completions is updated.

[0134] For example, Figure 6 As shown, the historical timestamp currently read is 2025-06-19 10:45:45. The historical timestamp 2025-06-19 10:45:45 is not the target timestamp and is not the first historical timestamp in the historical timestamp sequence. Based on the historical timestamp 2025-06-19 10:45:45 and the previous historical timestamp 2025-06-18 09:59:45 read, the first continuous relationship between the historical timestamp 2025-06-19 10:45:45 and the previous historical timestamp 2025-06-18 09:59:45 is determined, and based on the first continuous relationship, the current accumulated number of continuous completions is updated.

[0135] Specifically, when determining the continuous relationship between the historical timestamp and the previous historical timestamp, the server specifically performs the following operations. Figure 7 As shown, it is a schematic diagram of the process of determining the continuous relationship between two historical timestamps in an embodiment of the present application. Figure 7 , and explain in detail the specific operations performed:

[0136] Step 2112-1: Based on the previous historical timestamp, determine the time period in which the previous historical timestamp is located.

[0137] In the embodiment of the present application, based on the read last historical timestamp, the time period in which the last historical timestamp is located is determined according to the preset target time period intensity level.

[0138] Among them, the intensity level of the target time period can be days, months, hours, etc., and the embodiments of the present application do not limit this.

[0139] For example, assuming that the last historical timestamp read is 2025-06-18 09:59:45, and the target time period intensity level is day, then the time period of the last historical timestamp is 2025-06-18.

[0140] Step 2112-2: Determine whether the historical timestamp is within the time period between the end time of the time period and the end time of the next time period. If so, execute step 2112-3; otherwise, execute step 2112-4.

[0141] Step 2112 - 3 : Determine that the first continuous relationship between the historical timestamp and the previous historical timestamp is continuous.

[0142] In an embodiment of the present application, after obtaining the time period in which the previous historical timestamp is located, the end time of the time period and the end time of the next time period are determined, and it is judged whether the historical timestamp is within the time period between the end time of the time period and the end time of the next time period. If the currently read historical timestamp is not within the time period between the end time of the time period and the end time of the next time period, it is determined that the first continuous relationship between the historical timestamp and the previous historical timestamp is discontinuous.

[0143] For example, suppose the currently read historical timestamp is 2025-06-19 10:45:45, the previous historical timestamp read is 2025-06-18 09:59:45, the time period of the previous historical timestamp is 2025-06-18, the end time of 2025-06-18 is 2025-06-19 00:00:00, the next time period is 2025-06-19, the end time of 2025-06-19 is 2025-06-20 00:00:00, and the currently read historical timestamp 2025-06-19 10:45:45 is within the time period from 2025-06-19 00:00:00 to 2025-06-20 00:00:00, then the currently read historical timestamp 2025-06-19 The first continuous relationship between 10:45:45 and the previous historical timestamp is continuous.

[0144] Step 2112 - 4 : Determine that the first continuous relationship between the historical timestamp and the previous historical timestamp is discontinuous.

[0145] In an embodiment of the present application, after obtaining the time period in which the previous historical timestamp is located, the end time of the time period and the end time of the next time period are determined, and it is judged whether the historical timestamp is within the time period between the end time of the time period and the end time of the next time period. If the historical timestamp currently read is within the time period between the end time of the time period and the end time of the next time period, then the first continuous relationship between the historical timestamp and the previous historical timestamp is determined to be continuous.

[0146] For example, suppose the currently read historical timestamp is 2025-06-20 10:50:50, the previous historical timestamp is 2025-06-18 09:59:45, the time period of the previous historical timestamp is 2025-06-18, the end time of 2025-06-18 is 2025-06-19 00:00:00, the next time period is 2025-06-19, the end time of 2025-06-19 is 2025-06-20 00:00:00, the currently read historical timestamp 2025-06-20 10:50:50 is not in the time period from 2025-06-19 00:00:00 to 2025-06-20 00:00:00, then the currently read historical timestamp 2025-06-20 The first continuous relationship between 10:50:50 and the previous historical timestamp is discontinuous.

[0147] In this way, according to the preset target time period intensity level, the time period in which the earlier historical timestamp is located is determined, and then it is determined whether the later historical timestamp is within the time period between the end time of the time period and the end time of the next time period. Regardless of whether the target time period intensity level is days, months, hours, etc., the continuous relationship between the two historical timestamps can be determined.

[0148] Specifically, when updating the current accumulated number of consecutive completions based on the first continuous relationship, the server specifically performs the following operations. Figure 8 As shown, it is a second flow chart of updating the current accumulated number of consecutive completions in the embodiment of the present application. Figure 8 , and explain in detail the specific operations performed:

[0149] Step 2112-5: Determine whether the first continuous relationship is continuous, if so, execute step 2112-6, otherwise, execute step 2112-7.

[0150] Step 2112-6: Add 1 to the current accumulated number of consecutive completions.

[0151] In the embodiment of the present application, it is determined whether the first continuous relationship between the historical timestamp and the previous historical timestamp is continuous. If the first continuous relationship between the historical timestamp and the previous historical timestamp is continuous, the current accumulated number of continuous completions is increased by 1.

[0152] For example, see Fig.9A As shown, this is a second schematic diagram of updating the current accumulated number of consecutive completions in an embodiment of the present application. Assume that the historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-19 10:45:45, 2025-06-23 16:30:35}, the historical timestamp currently read is 2025-06-19 10:45:45, the timestamp to be inserted is 2025-06-21 18:14:03, and the first continuous relationship between the historical timestamp 2025-06-19 10:45:45 and the previous historical timestamp 2025-06-18 09:59:45 is continuous, then the current accumulated number of consecutive completions is increased by 1, and if the current accumulated number of consecutive completions is 1, the updated accumulated number of consecutive completions is 2.

[0153] Step 2112-7: Reset the current accumulated number of consecutive completions to 1.

[0154] In the embodiment of the present application, it is determined whether the first continuous relationship between the historical timestamp and the previous historical timestamp is continuous. If the first continuous relationship between the historical timestamp and the previous historical timestamp is discontinuous, the current accumulated number of continuous completions is increased by 1.

[0155] For example, see Fig. 9B As shown, this is a third schematic diagram of updating the current accumulated number of consecutive completions in an embodiment of the present application. Assuming that the historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-20 10:50:50, 2025-06-23 16:30:35}, the historical timestamp currently read is 2025-06-20 10:50:50, and the timestamp to be inserted is 2025-06-21 18:14:03. The first continuous relationship between the historical timestamp 2025-06-20 10:50:50 and the previous historical timestamp 2025-06-18 09:59:45 is discontinuous, then the current accumulated number of consecutive completions is reset to 1.

[0156] Step 212: Use the timestamp to be inserted as a new historical timestamp, insert it into the target space before the historical timestamp, and update the current accumulated number of consecutive completions.

[0157] In an embodiment of the present application, the currently read historical timestamp is compared with the timestamp to be inserted to determine whether the currently read historical timestamp is the target timestamp. When the historical timestamp is the target timestamp, the timestamp to be inserted is used as the new historical timestamp, inserted into the target space before the historical timestamp, and the current accumulated number of consecutive completions is updated.

[0158] For example, assuming that the historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-22 09:59:45, 2025-06-23 16:30:35}, the historical timestamp currently read is 2025-06-22 09:59:45, the timestamp to be inserted is 2025-06-21 18:14:03, and 2025-06-22 09:59:45 is the first historical timestamp later than the timestamp to be inserted. Then the historical timestamp 2025-06-22 09:59:45 is the target timestamp, and the timestamp to be inserted is used as the new historical timestamp to be inserted into the target slot before the historical timestamp 2025-06-22 09:59:45, and the current accumulated number of consecutive completions is updated.

[0159] Specifically, when executing step 212 and updating the current accumulated number of consecutive completions, the server specifically performs the following operations. Fig.10 As shown, it is a third flow chart of updating the current accumulated number of consecutive completions in the embodiment of the present application. Fig.10 , and explain in detail the specific operations performed:

[0160] Step 2120: Determine whether the historical timestamp currently read is the first historical timestamp in the historical timestamp sequence. If so, execute step 2121; otherwise, execute step 2122.

[0161] Step 2121: Based on the fourth continuous relationship between the time stamp to be inserted and the historical time stamp, the current accumulated number of continuous completions is updated.

[0162] In an embodiment of the present application, it is determined whether the historical timestamp is the first historical timestamp in the historical timestamp sequence. If the historical timestamp is the first historical timestamp in the historical timestamp sequence, then based on the timestamp to be inserted, the time period in which the timestamp to be inserted is located is determined, and it is determined whether the historical timestamp is within the time period between the end moment of the time period and the end moment of the next time period, and the fourth continuous relationship between the timestamp to be inserted and the historical timestamp is obtained, and then based on the fourth continuous relationship, the current accumulated number of consecutive completions is updated.

[0163] Specifically, when updating the current accumulated number of consecutive completions based on the fourth continuous relationship, the server specifically performs the following operations. Fig.11 As shown, it is a fourth flow chart of updating the current accumulated number of consecutive completions in the embodiment of the present application. Fig.11 , and explain in detail the specific operations performed:

[0164] Step 2121-1: Determine whether the fourth continuous relationship is continuous, if so, execute step 2121-2, otherwise, execute step 2121-3.

[0165] Step 2121-2: Set the current accumulated number of consecutive completions to 2.

[0166] In an embodiment of the present application, when the currently traversed historical timestamp is the target timestamp and is the first historical timestamp in the historical timestamp sequence, after obtaining the fourth continuous relationship between the timestamp to be inserted and the historical timestamp, it is determined whether the fourth continuous relationship is continuous. If the fourth relationship is continuous, the current accumulated number of continuous completions is set to 2.

[0167] For example, see Fig. 12A As shown, this is the fourth schematic diagram for updating the current accumulated number of consecutive completions in an embodiment of the present application. Assuming that the historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-2010:50:50, 2025-06-2316:30:35}, the historical timestamp currently read is 2025-06-18 09:59:45, the timestamp to be inserted is 2025-06-1718:14:03, and the fourth continuous relationship between the historical timestamp 2025-06-18 09:59:45 and the timestamp to be inserted is continuous, then the current accumulated number of consecutive completions is increased by 1.

[0168] Step 2121 - 3: reset the current accumulated number of consecutive completions to 1, and use 1 as the number of consecutive completions corresponding to the timestamp to be inserted.

[0169] In an embodiment of the present application, when the currently traversed historical timestamp is the target timestamp and is the first historical timestamp in the historical timestamp sequence, after obtaining the fourth continuous relationship between the timestamp to be inserted and the historical timestamp, it is determined whether the fourth continuous relationship is discontinuous. If the fourth relationship is discontinuous, the current accumulated number of continuous completions is set to 1, and 1 is used as the number of continuous completions corresponding to the timestamp to be inserted.

[0170] For example, see Fig. 12BAs shown, this is the fifth schematic diagram for updating the current accumulated number of consecutive completions in an embodiment of the present application. Assume that the historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-2010:50:50, 2025-06-2316:30:35}, the historical timestamp currently read is 2025-06-18 09:59:45, the timestamp to be inserted is 2025-06-1618:14:03, and the fourth continuous relationship between the historical timestamp 2025-06-18 09:59:45 and the timestamp to be inserted is discontinuous, then the current accumulated number of consecutive completions is reset to 1, and 1 is used as the number of consecutive completions corresponding to the timestamp to be inserted.

[0171] The number of consecutive completions corresponding to the time stamp to be inserted is the length of the continuous sub-time stamp sequence where the time stamp to be inserted is located after the time stamp to be inserted is inserted into the historical time stamp sequence.

[0172] For example, assuming that the timestamp to be inserted is 2025-06-21 18:14:03, and the historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-20 10:50:50, 2025-06-23 16:30:35}, after the timestamp to be inserted is inserted into the historical timestamp sequence, the historical timestamp sequence is {2025-06-18 09:59:45, 2025-06-20 10:50:50, 2025-06-21 18:14:03, 2025-06-23 16:30:35}. According to the empty space, the historical timestamp sequence can be divided into consecutive sub-timestamp sequences: {2025-06-18 09:59:45}, {2025-06-20 10:50:50, 2025-06-21 18:14:03}, {2025-06-23 16:30:35}, the length of the continuous sub-timestamp sequence where the timestamp to be inserted is located is 2, so the number of consecutive completions corresponding to the timestamp to be inserted is 2.

[0173] Step 2122: Based on the second continuous relationship between the timestamp to be inserted and the last historical timestamp read, and the third continuous relationship between the timestamp to be inserted and the historical timestamp, the current accumulated number of continuous completions is updated.

[0174] In an embodiment of the present application, it is determined whether the historical timestamp is the first historical timestamp in the historical timestamp sequence. If the historical timestamp is not the first historical timestamp in the historical timestamp sequence, a second continuous relationship between the timestamp to be inserted and the previous historical timestamp read is determined based on the timestamp to be inserted and the previous historical timestamp read, and a third continuous relationship between the timestamp to be inserted and the historical timestamp is determined based on the timestamp to be inserted and the historical timestamp, thereby updating the currently accumulated number of continuous completions based on the second continuous relationship and the third continuous relationship.

[0175] Specifically, when updating the current accumulated number of consecutive completions based on the second continuous relationship and the third continuous relationship, the server specifically performs the following operations. Fig.13 As shown, it is a fifth flow chart of updating the current accumulated number of consecutive completions in the embodiment of the present application. Fig.13 , and explain in detail the specific operations performed:

[0176] Step 2122-1: Determine whether the second continuous relationship and the third continuous relationship are both continuous. If so, execute step 2122-2; otherwise, execute step 2122-3.

[0177] Step 2122-2: Add 2 to the current accumulated number of consecutive completions.

[0178] In an embodiment of the present application, when the currently traversed historical timestamp is the target timestamp and is not the first historical timestamp in the historical timestamp sequence, after obtaining the second continuous relationship between the timestamp to be inserted and the last historical timestamp read, and the third continuous relationship between the timestamp to be inserted and the historical timestamp, it is determined whether the second continuous relationship and the third continuous relationship are both continuous. If the second continuous relationship is continuous and the third continuous relationship is continuous, the current accumulated number of continuous completions is increased by 2.

[0179] For example, see Fig.14AAs shown, this is the sixth schematic diagram of updating the current accumulated number of consecutive completions in an embodiment of the present application. Assume that the historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-20 10:50:50, 2025-06-23 16:30:35}, the historical timestamp currently read is 2025-06-20 10:50:50, the timestamp to be inserted is 2025-06-19 18:14:03, the third continuous relationship between the historical timestamp 2025-06-20 10:50:50 and the timestamp to be inserted is continuous, and the second continuous relationship between the timestamp to be inserted and the last read historical timestamp 2025-06-18 09:59:45 is continuous, then the current accumulated number of consecutive completions is increased by 2, and if the current accumulated number of consecutive completions is 1, the updated current accumulated number of consecutive completions is 3.

[0180] Step 2122-3: Determine whether the second continuous relationship is discontinuous and whether the third continuous relationship is continuous. If so, execute step 2122-4; otherwise, execute step 2122-5.

[0181] Step 2122-4: Set the current accumulated number of consecutive completions to 2.

[0182] In an embodiment of the present application, when the currently traversed historical timestamp is the target timestamp and is not the first historical timestamp in the historical timestamp sequence, after obtaining the second continuous relationship between the timestamp to be inserted and the last historical timestamp read, and the third continuous relationship between the timestamp to be inserted and the historical timestamp, it is determined whether the second continuous relationship and the third continuous relationship are both continuous. If the second continuous relationship is discontinuous and the third continuous relationship is continuous, the current accumulated number of continuous completions is set to 2.

[0183] For example, see Fig. 14B As shown, this is the seventh schematic diagram for updating the current accumulated number of consecutive completions in an embodiment of the present application. Assume that the historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-20 10:50:50, 2025-06-23 16:30:35}, the historical timestamp currently read is 2025-06-23 16:30:35, the timestamp to be inserted is 2025-06-22 18:14:03, the third continuous relationship between the historical timestamp 2025-06-23 16:30:35 and the timestamp to be inserted is continuous, and the second continuous relationship between the timestamp to be inserted and the last historical timestamp read 2025-06-20 10:50:50 is discontinuous, then the current accumulated number of consecutive completions is set to 2.

[0184] Step 2122-5: Determine whether the second continuous relationship and the third continuous relationship are both discontinuous, if so, execute step 2122-6, otherwise, execute step 2122-7.

[0185] Step 2122-6: Set the current accumulated number of consecutive completions to 1, and use 1 as the number of consecutive completions corresponding to the timestamp to be inserted.

[0186] In an embodiment of the present application, when the currently traversed historical timestamp is the target timestamp and is not the first historical timestamp in the historical timestamp sequence, after obtaining the second continuous relationship between the timestamp to be inserted and the last historical timestamp read, and the third continuous relationship between the timestamp to be inserted and the historical timestamp, it is determined whether the second continuous relationship and the third continuous relationship are both continuous. If the second continuous relationship and the third continuous relationship are both discontinuous, the current accumulated number of continuous completions is set to 1, and 1 is used as the number of continuous completions corresponding to the timestamp to be inserted.

[0187] For example, see Fig. 14C As shown, it is an eighth schematic diagram of updating the current accumulated number of consecutive completions in an embodiment of the present application, assuming that the historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-19 10:24:45, 2025-06-23 16:30:35}, the currently read historical timestamp is 2025-06-23 16:30:35, the timestamp to be inserted is 2025-06-21 18:14:03, the third continuous relationship between the historical timestamp 2025-06-23 16:30:35 and the timestamp to be inserted is discontinuous, and the timestamp to be inserted and the previous historical timestamp read 2025-06-19 If the second continuous relationship between 10:24:45 is discontinuous, the current accumulated continuous completion count is set to 1, and 1 is used as the continuous completion count corresponding to the timestamp to be inserted. If the current accumulated continuous completion count is 2, the updated current accumulated continuous completion count is 1, and 1 is used as the continuous completion count corresponding to the timestamp to be inserted.

[0188] Step 2122-7: Add 1 to the current accumulated continuous completion count as the continuous completion count corresponding to the timestamp to be inserted, and set the current accumulated continuous completion count to 1.

[0189] In an embodiment of the present application, when the currently traversed historical timestamp is the target timestamp and is not the first historical timestamp in the historical timestamp sequence, after obtaining the second continuous relationship between the timestamp to be inserted and the last historical timestamp read, and the third continuous relationship between the timestamp to be inserted and the historical timestamp, it is determined whether the second continuous relationship and the third continuous relationship are both continuous. If the second continuous relationship is discontinuous and the third continuous relationship is continuous, the current accumulated number of continuous completions is added by 1 as the number of continuous completions corresponding to the timestamp to be inserted, and the current accumulated number of continuous completions is set to 1.

[0190] For example, see Fig.14D As shown, it is a ninth schematic diagram of updating the current accumulated number of consecutive completions in an embodiment of the present application. Assume that the historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-20 10:50:50, 2025-06-23 16:30:35}, the currently read historical timestamp is 2025-06-23 16:30:35, the timestamp to be inserted is 2025-06-21 18:14:03, and the third continuous relationship between the historical timestamp 2025-06-23 16:30:35 and the timestamp to be inserted is discontinuous. The timestamp to be inserted and the previous historical timestamp read 2025-06-20 If the second continuous relationship between 10:50:50 is continuous, the current accumulated continuous completion count is added by 1 as the continuous completion count corresponding to the timestamp to be inserted, and the current accumulated continuous completion count is set to 1. If the current accumulated continuous completion count is 1, the continuous completion count corresponding to the timestamp to be inserted is 2, and the updated current accumulated continuous completion count is 1.

[0191] In this way, since the insertion of the timestamp to be inserted into the historical timestamp sequence will affect the current cumulative number of consecutive completions, the updated current cumulative number of consecutive completions is determined based on the second continuous relationship between the timestamp to be inserted and the last historical timestamp read, and the third continuous relationship between the timestamp to be inserted and the historical timestamp. In addition, the insertion of the timestamp to be inserted into the historical timestamp sequence will affect the local number of consecutive completions where the timestamp to be inserted is located. Therefore, it is necessary to calculate the number of consecutive completions corresponding to the timestamp to be inserted. If the number of consecutive completions corresponding to the timestamp to be inserted reaches the target number, the preset reward will be distributed to the target object.

[0192] Optionally, in the process of traversing the historical timestamp sequence, each time a historical timestamp is read, an anomaly detection can be performed on the timestamp to be inserted based on the time period of the timestamp to be inserted and the historical timestamp currently read. The specific operations performed are described in detail below:

[0193] Step 30: Based on the time stamp to be inserted, determine the time period in which the time stamp to be inserted is located, and based on the historical time stamp currently read, determine the time period in which the historical time stamp currently read is located.

[0194] In an embodiment of the present application, according to a preset target time period intensity level, based on the timestamp to be inserted, the time period in which the timestamp to be inserted is located is determined, and based on the historical timestamp currently read, the time period in which the historical timestamp currently read is located is determined.

[0195] For example, assuming that the target time period intensity level is day, the timestamp to be inserted is 2025-06-18 16:34:02, and the historical timestamp currently read is 2025-06-18 09:59:45, then the time period of the timestamp to be inserted is 2025-06-18, and the time period of the historical timestamp currently read is 2025-06-18.

[0196] Step 31: Determine whether the time period of the time stamp to be inserted is the same as the time period of the currently read historical time stamp. If so, execute step 32; otherwise, execute step 33.

[0197] Step 32: Determine whether the timestamp to be inserted is abnormal.

[0198] In an embodiment of the present application, it is determined whether the time period of the timestamp to be inserted is the same as the time period of the historical timestamp currently read. If the time period of the timestamp to be inserted is the same as the time period of the historical timestamp currently read, it is determined that the timestamp to be inserted is abnormal, and the timestamp to be inserted is not written into the historical timestamp sequence, and the number of consecutive completions of the target corresponding to the historical timestamp sequence does not change.

[0199] For example, assuming that the time period of the timestamp to be inserted is 2025-06-18, and the time period of the historical timestamp currently read is 2025-06-18, the two time periods are the same, then it is determined that the timestamp to be inserted is abnormal.

[0200] Step 33: Determine that the timestamp to be inserted is normal.

[0201] In the embodiment of the present application, it is determined whether the time period of the timestamp to be inserted is the same as the time period of the historical timestamp currently read. If the time period of the timestamp to be inserted is not the same as the time period of the historical timestamp currently read, it is determined that the timestamp to be inserted is normal, and step 210 is executed.

[0202] For example, assuming that the time period of the timestamp to be inserted is 2025-06-19, and the time period of the historical timestamp currently read is 2025-06-18, the two time periods are different, and it is determined that the timestamp to be inserted is normal.

[0203] In this way, the timestamps to be inserted are firstly detected for abnormality, and the abnormal timestamps to be inserted are not inserted, so that the insertion of timestamps with repeated time periods is avoided, and the accuracy of determining the number of consecutive completions is improved.

[0204] Specifically, after the traversal is completed, the server outputs the final cumulative number of consecutive completions of the target and performs the following operations. Fig.15 As shown, it is a first flow chart of outputting the final accumulated number of consecutive completions of the target in the embodiment of the present application. Fig.15 , and explain in detail the specific operations performed:

[0205] Step 213: The current accumulated continuous completion times after the last reading is used as the target continuous completion times and outputted.

[0206] Among them, the final accumulated target consecutive times is the consecutive completion times corresponding to the continuous tasks.

[0207] For example, assuming that after the last reading, the current accumulated number of consecutive completions is 6, then the final accumulated target number of consecutive completions is 6.

[0208] Step 214: When the continuity relationship between the target timestamp and the timestamp to be inserted is continuous, determine whether there is a reset timestamp in the historical timestamp sequence. If so, execute step 215; otherwise, execute step 216.

[0209] The reset timestamp is a historical timestamp in the historical timestamp sequence that is after the target timestamp and is discontinuous with the previous historical timestamp.

[0210] Step 215: The current accumulated number of consecutive completions corresponding to the previous historical timestamp of the reset timestamp is used as the number of consecutive completions corresponding to the timestamp to be inserted.

[0211] In an embodiment of the present application, when the continuity relationship between the target timestamp and the timestamp to be inserted is continuous, it is determined whether there is a reset timestamp in the historical timestamp sequence. If there is a historical timestamp in the historical timestamp sequence that is later than the target timestamp and is discontinuous with the previous historical timestamp, that is, the reset timestamp, then the current accumulated number of continuous completions corresponding to the previous historical timestamp of the reset timestamp is used as the number of continuous completions corresponding to the timestamp to be inserted.

[0212] For example, see Fig.16AAs shown, this is a first schematic diagram for determining the number of consecutive completions corresponding to the timestamp to be inserted in an embodiment of the present application. Assume that the historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-20 10:50:50, 2025-06-23 16:30:35}, the timestamp to be inserted is 2025-06-1918:14:03, then the target timestamp is 2025-06-20 10:50:50, and there is a reset timestamp 2025-06-23 16:30:35 in the historical timestamp sequence. The current accumulated consecutive completion number 3 corresponding to the previous historical timestamp 2025-06-20 10:50:50 of the reset timestamp is used as the consecutive completion number corresponding to the timestamp to be inserted, and the consecutive completion number corresponding to the timestamp to be inserted is 3.

[0213] Step 216: The target continuous completion number is used as the continuous completion number corresponding to the time stamp to be inserted.

[0214] In an embodiment of the present application, when the continuity relationship between the target timestamp and the timestamp to be inserted is continuous, it is determined whether there is a reset timestamp in the historical timestamp sequence. If there is no reset timestamp in the historical timestamp sequence, the target continuous completion number is used as the continuous completion number corresponding to the timestamp to be inserted.

[0215] For example, see Fig. 16B As shown, this is a second schematic diagram for determining the number of consecutive completions corresponding to the timestamp to be inserted in an embodiment of the present application. Assuming that the historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-20 10:50:50, 2025-06-21 16:30:35}, the timestamp to be inserted is 2025-06-1918:14:03, then the target timestamp is 2025-06-20 10:50:50, and there is no reset timestamp in the historical timestamp sequence. The target consecutive completion number 4 is used as the consecutive completion number corresponding to the timestamp to be inserted, and the consecutive completion number corresponding to the timestamp to be inserted is 4.

[0216] Furthermore, after traversing the historical timestamp sequence and outputting the final accumulated number of consecutive target completions, if the timestamp to be inserted is not inserted into the historical timestamp sequence, the following operations are performed. Fig.17 As shown, it is a second flow chart of outputting the final accumulated number of consecutive completions of the target in the embodiment of the present application. Fig.17 , and explain in detail the specific operations performed:

[0217] Step 22: After the traversal is completed, if the timestamp to be inserted has not been inserted into the historical timestamp sequence, the timestamp to be inserted is inserted into the target empty position after the last historical timestamp included in the historical timestamp sequence.

[0218] In an embodiment of the present application, after the traversal is completed, the target timestamp is not found, and the timestamp to be inserted is later than the last historical timestamp included in the historical timestamp sequence, and the timestamp to be inserted is inserted into the target empty space after the last historical timestamp.

[0219] For example, assuming that the historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-20 10:50:50, 2025-06-21 16:30:35}, and the timestamp to be inserted is 2025-06-22 18:14:03, then the timestamp to be inserted is later than the last historical timestamp 2025-06-21 16:30:35 contained in the historical timestamp sequence, and the timestamp to be inserted is inserted into the target space after the last historical timestamp, and the updated historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-20 10:50:50, 2025-06-21 16:30:35, 2025-06-22 18:14:03}.

[0220] Step 23: Based on the fifth continuous relationship between the timestamp to be inserted and the last historical timestamp, the target continuous completion number is updated, and the updated target continuous completion number is used as the continuous completion number corresponding to the timestamp to be inserted.

[0221] In an embodiment of the present application, based on the timestamp to be inserted and the last historical timestamp, the fifth continuous relationship between the timestamp to be inserted and the last historical timestamp is determined, and it is judged whether the fifth continuous relationship is continuous. If the fifth continuous relationship is continuous, the target continuous completion number is increased by 1; if the fifth continuous relationship is discontinuous, the target continuous completion number is set to 1, and the updated target continuous completion number is used as the continuous completion number corresponding to the timestamp to be inserted.

[0222] For example, see Fig.18AAs shown, this is a third schematic diagram for determining the number of consecutive completions corresponding to the timestamp to be inserted in an embodiment of the present application. Assume that the historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-20 10:50:50, 2025-06-21 16:30:35}, the timestamp to be inserted is 2025-06-2218:14:03, and the fifth continuous relationship between the timestamp to be inserted and the last historical timestamp 2025-06-21 16:30:35 is continuous, then the target consecutive completion number is increased by 1, if the target consecutive completion number before the update is 2, then the target consecutive completion number after the update is 3, and the updated target consecutive completion number 3 is used as the consecutive completion number corresponding to the timestamp to be inserted.

[0223] For example, see Fig.18B As shown, this is the fourth schematic diagram for determining the number of consecutive completions corresponding to the timestamp to be inserted in an embodiment of the present application, assuming that the historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-20 10:50:50, 2025-06-21 16:30:35}, the timestamp to be inserted is 2025-06-2318:14:03, and the fifth continuous relationship between the timestamp to be inserted and the last historical timestamp 2025-06-21 16:30:35 is discontinuous, then the target consecutive completion number is set to 1, if the target consecutive completion number before the update is 2, then the target consecutive completion number after the update is 1, and the updated target consecutive completion number 1 is used as the consecutive completion number corresponding to the timestamp to be inserted, and the consecutive completion number corresponding to the timestamp to be inserted is 1.

[0224] Step 24: Add 1 to the cumulative number of completions corresponding to the continuous tasks, and output each number of completions.

[0225] In the embodiment of the present application, after the timestamp to be inserted is inserted into the historical timestamp sequence, the cumulative number of completions corresponding to the continuous tasks is increased by 1, and the final cumulative number of completions, the cumulative target continuous number of completions and the continuous number of completions corresponding to the timestamp to be inserted are output.

[0226] For example, assuming that the historical timestamp sequence is: {2025-06-18 09:59:45, 2025-06-20 10:50:50, 2025-06-23 16:30:35}, and the timestamp to be inserted is 2025-06-19 18:14:03, before insertion, the cumulative number of completions corresponding to the continuous tasks is 3, and the target number of continuous completions is 1. After insertion, the cumulative number of completions corresponding to the continuous tasks is 3+1=2, the target number of continuous completions is 1, and the number of continuous completions corresponding to the timestamp to be inserted is 3.

[0227] Based on the above embodiments, see Fig.19 As shown, it is a schematic diagram of the second process of traversing the historical timestamp sequence in an embodiment of the present application, which specifically includes:

[0228] Step 1901: Determine whether the timestamp to be inserted has not been inserted into the historical timestamp sequence. If so, execute step 1902; otherwise, execute step 1917.

[0229] Step 1902: Determine whether the time period of the timestamp to be inserted and the currently read historical timestamp is the same, if so, execute step 1903, otherwise, execute step 1904.

[0230] Step 1903: Determine whether the timestamp to be inserted is abnormal.

[0231] Step 1904: Determine whether the timestamp to be inserted is greater than the historical timestamp. If so, execute step 1905; otherwise, execute step 1910.

[0232] Step 1905: Determine whether the historical timestamp is the first historical timestamp, if so, execute step 1906, otherwise, execute step 1907.

[0233] Step 1906: Initialize the current accumulated number of consecutive completions to 1.

[0234] Step 1907: Determine whether the historical timestamp and the last historical timestamp read are continuous. If so, execute step 1908; otherwise, execute step 1909.

[0235] Step 1908: Add 1 to the current accumulated number of consecutive completions.

[0236] Step 1909: Reset the current accumulated number of consecutive completions to 1.

[0237] Step 1910: Insert the timestamp to be inserted into the target space before the historical timestamp, and increase the cumulative completion count by 1.

[0238] Step 1911: Determine whether the timestamp to be inserted and the previous historical timestamp are continuous. If so, execute step 1912; otherwise, execute step 1913.

[0239] Step 1912: Add 1 to the current accumulated number of consecutive completions, and execute step 1914.

[0240] Step 1913: reset the current accumulated number of consecutive completions to 1, and execute step 1914.

[0241] Step 1914: Determine whether the timestamp to be inserted and the historical timestamp are continuous. If so, execute step 1915; otherwise, execute step 1916.

[0242] Step 1915: Add 1 to the current accumulated number of consecutive completions.

[0243] Step 1916: The current accumulated number of consecutive completions is used as the number of consecutive completions corresponding to the timestamp to be inserted, and the current accumulated number of consecutive completions is set to 1.

[0244] Step 1917: Determine whether the historical timestamp and the previous historical timestamp are continuous. If so, execute step 1918; otherwise, execute step 1919.

[0245] Step 1918: Add 1 to the current accumulated number of consecutive completions.

[0246] Step 1919: Reset the current accumulated number of consecutive completions to 1.

[0247] Optionally, when the timestamp to be inserted is recorded for the first time, that is, when the historical timestamp sequence is empty, the timestamp to be inserted is directly written into the historical timestamp sequence, the cumulative number of completions corresponding to the continuous tasks is set to 1, and the target continuous number of completions is set to 1.

[0248] Optionally, in scenarios where the continuous task does not allow for the elimination of interruptions by completing supplementary tasks, during the target object's completion of the continuous task, refer to Fig. 20 As shown, it is a third implementation flow chart of a method for determining the number of consecutive task completions provided in an embodiment of the present application. Fig. 20 , and explain in detail the specific operations performed:

[0249] Step 2001: In response to a write request triggered by a target object, a historical timestamp sequence generated based on the completion status of continuous tasks is obtained, and a to-be-written timestamp corresponding to the write request is obtained.

[0250] Among them, each historical timestamp corresponds to the completion of a continuous task.

[0251] Step 2002: Determine whether the timestamp to be written is greater than the last historical timestamp included in the historical timestamp sequence. If so, execute step 2003; otherwise, execute step 2004.

[0252] Step 2003: Determine whether the time period of the timestamp to be written is the same as the time period of the last historical timestamp. If so, execute step 2004; otherwise, execute step 2005.

[0253] Step 2004: Determine that the timestamp to be written is abnormal.

[0254] In the embodiment of the present application, when the timestamp to be written is abnormal, the timestamp to be inserted is not written into the historical timestamp sequence, and the target continuous completion number corresponding to the historical timestamp sequence does not change.

[0255] Step 2005: Write the timestamp to be written into a target position after the last historical timestamp included in the historical timestamp sequence.

[0256] Step 2006: Determine whether the timestamp to be written is continuous with the last historical timestamp. If so, execute step 2007; otherwise, execute step 2008.

[0257] In an embodiment of the present application, based on the last historical timestamp, the time period in which the last historical timestamp is located is determined. If the timestamp to be written is in the time period between the end moment of the time period in which the last historical timestamp is located and the end moment of the next time period, then the timestamp to be written is continuous with the last historical timestamp. If the timestamp to be written is not in the time period between the end moment of the time period in which the last historical timestamp is located and the end moment of the next time period, then the timestamp to be written is discontinuous with the last historical timestamp.

[0258] Step 2007: Add 1 to the target continuous completion times corresponding to the continuous task, add 1 to the cumulative completion times corresponding to the continuous task, and output the final cumulative completion times and the cumulative target continuous completion times.

[0259] Step 2008: Set the target consecutive completion times to 1, add 1 to the cumulative completion times corresponding to the continuous tasks, and output the final cumulative completion times and the cumulative target consecutive completion times.

[0260] For example, see Fig.21 As shown, it is a schematic diagram of a scenario in which interruption elimination is not allowed in an embodiment of the present application. Assume that the time period of the continuous task is one day, the historical timestamp sequence is: {2025-06-19 10:45:45, 2025-06-22 09:59:45, 2025-06-23 16:30:35}, the target continuous completion times is 2, the cumulative completion times is 3, the timestamp A to be written is 2025-06-24 18:14:03, and the timestamp B to be written is 2025-06-25 18:14:03. Then, the timestamp A to be written is continuous with the last historical timestamp 2025-06-23 16:30:35. After the timestamp A to be written is written into the historical timestamp sequence, the updated target continuous completion times is 2+1=3, the cumulative completion times is 4, and the timestamp B to be written is continuous with the last historical timestamp 2025-06-23 16:30:35 is discontinuous. After the write timestamp B is written into the historical timestamp sequence, the updated target continuous completion times is 1 and the cumulative completion times is 4.

[0261] Based on the same inventive concept as the above method embodiment, the present application embodiment also provides a device for determining the number of consecutive completions, see Fig. 22 , which is a schematic diagram of a structure of a device for determining the number of consecutive completions provided in an embodiment of the present application, the device 2200 includes:

[0262] The acquisition module 2201 is used to acquire a historical timestamp sequence generated based on the completion status of the continuous tasks and a to-be-inserted timestamp corresponding to the supplementary tasks in response to the supplementary tasks triggered by the target object during the process of the target object completing the continuous tasks; wherein each historical timestamp corresponds to a completion status of the continuous tasks, and the historical timestamp sequence includes: a target vacancy corresponding to the supplementary tasks;

[0263] The first processing module 2202 is used to traverse the historical timestamp sequence and output the final accumulated number of consecutive target completions after the traversal is completed. Each time the sequence is read, the following operations are performed:

[0264] If the currently read historical timestamp is not the target timestamp, the current accumulated number of consecutive completions is updated. The target timestamp is: the first historical timestamp in the historical timestamp sequence that is later than the insertion timestamp;

[0265] If the historical timestamp is the target timestamp, the timestamp to be inserted is used as the new historical timestamp, inserted into the target space before the historical timestamp, and the current accumulated number of consecutive completions is updated.

[0266] In a possible implementation, if the currently read historical timestamp is not the target timestamp, the currently accumulated number of consecutive completions is updated, and the first processing module 2202 is further used to:

[0267] If the currently read historical timestamp is not the target timestamp, and the historical timestamp is the first historical timestamp in the historical timestamp sequence, the currently accumulated number of consecutive completions is initialized to 1;

[0268] If the historical timestamp is not the target timestamp, and the historical timestamp is not the first historical timestamp, then based on the historical timestamp and the last historical timestamp read, determine the first continuous relationship between the historical timestamp and the last historical timestamp, and based on the first continuous relationship, update the current accumulated number of continuous completions.

[0269] In a possible implementation, when determining the continuous relationship between the historical timestamp and the previous historical timestamp read based on the historical timestamp and the previous historical timestamp, the first processing module 2202 is further configured to:

[0270] Based on the previous historical timestamp, determine the time period of the previous historical timestamp;

[0271] If the historical timestamp is within the time period between the end time of the time period and the end time of the next time period, determining that the first continuous relationship between the historical timestamp and the previous historical timestamp is continuous;

[0272] If the historical timestamp is not within the time period between the end time of the time period and the end time of the next period, it is determined that the first continuous relationship between the historical timestamp and the previous historical timestamp is discontinuous.

[0273] In a possible implementation, when the current accumulated number of consecutive completions is updated based on the first continuous relationship, the first processing module 2202 is further configured to:

[0274] If the first continuous relationship is continuous, then add 1 to the current accumulated number of continuous completions;

[0275] If the first continuous relationship is discontinuous, the current accumulated number of consecutive completions is reset to 1.

[0276] In a possible implementation, if the historical timestamp is the target timestamp, the timestamp to be inserted is used as the new historical timestamp, inserted into the target space before the historical timestamp, and the current accumulated number of consecutive completions is updated. The first processing module 2202 is further used to:

[0277] When the historical timestamp is the target timestamp, the timestamp to be inserted is used as the new historical timestamp and inserted into the target space before the historical timestamp;

[0278] If the historical timestamp is not the first historical timestamp in the historical timestamp sequence, the current accumulated number of consecutive completions is updated based on the second continuous relationship between the timestamp to be inserted and the last historical timestamp read, and the third continuous relationship between the timestamp to be inserted and the historical timestamp;

[0279] If the historical timestamp is the first historical timestamp in the historical timestamp sequence, the currently accumulated continuous completion times are updated based on the fourth continuous relationship between the timestamp to be inserted and the historical timestamp.

[0280] In a possible implementation, based on the second continuous relationship between the timestamp to be inserted and the last historical timestamp read, and the third continuous relationship between the timestamp to be inserted and the historical timestamp, when updating the current accumulated number of consecutive completions, the first processing module 2202 is further used to:

[0281] If the second continuous relationship is continuous and the third continuous relationship is continuous, then add 2 to the current accumulated number of continuous completions;

[0282] If the second continuous relationship is discontinuous and the third continuous relationship is continuous, the current accumulated number of consecutive completions is set to 2;

[0283] If the second continuous relationship is discontinuous and the third continuous relationship is discontinuous, the current accumulated number of continuous completions is set to 1, and 1 is used as the number of continuous completions corresponding to the timestamp to be inserted;

[0284] If the second continuous relationship is continuous and the third continuous relationship is discontinuous, the current accumulated continuous completion count is increased by 1 as the continuous completion count corresponding to the time stamp to be inserted, and the current accumulated continuous completion count is set to 1.

[0285] In a possible implementation, when updating the current accumulated number of consecutive completions based on the fourth continuous relationship between the time stamp to be inserted and the historical time stamp, the first processing module 2202 is further configured to:

[0286] If the fourth continuous relationship is continuous, the current accumulated number of consecutive completions is set to 2;

[0287] If the fourth continuous relationship is discontinuous, the current accumulated number of continuous completions is set to 1, and 1 is used as the number of continuous completions corresponding to the timestamp to be inserted.

[0288] In a possible implementation, when traversing the historical timestamp sequence and outputting the final accumulated number of consecutive target completions after the traversal is completed, the first processing module 2202 is further configured to:

[0289] The current accumulated continuous completion times after the last reading is used as the final accumulated target continuous times and output;

[0290] If the continuity relationship between the target timestamp and the timestamp to be inserted is continuous, and there is no reset timestamp in the historical timestamp sequence, then the target continuous completion count is used as the continuous completion count corresponding to the timestamp to be inserted, and the reset timestamp is: the historical timestamp in the historical timestamp sequence that is after the target timestamp and is discontinuous with the previous historical timestamp;

[0291] If the continuity relationship between the target timestamp and the timestamp to be inserted is continuous, and there is a reset timestamp in the historical timestamp sequence, the current accumulated continuous completion count corresponding to the previous historical timestamp of the reset timestamp will be used as the continuous completion count corresponding to the timestamp to be inserted.

[0292] In a possible implementation, after traversing the historical timestamp sequence and outputting the final accumulated number of consecutive target completions after the traversal is completed, the device further includes a second processing module 2203, and the second processing module 2202 is used to:

[0293] After the traversal is completed, if the timestamp to be inserted has not been inserted into the historical timestamp sequence, the timestamp to be inserted is inserted into the target empty position after the last historical timestamp included in the historical timestamp sequence;

[0294] Based on the fifth continuous relationship between the timestamp to be inserted and the last historical timestamp, the target continuous completion count is updated, and the updated target continuous completion count is used as the continuous completion count corresponding to the timestamp to be inserted;

[0295] Add 1 to the cumulative number of completions corresponding to the consecutive tasks and output each completion number.

[0296] Based on the same inventive concept as the above method embodiment, the present application embodiment also provides a computing device. In one embodiment, the computing device may be a server, such as Figure 1 In this embodiment, the structure of the computer device 2300 is as follows: Fig.23 As shown, it may include at least a memory 2301 , a communication module 2303 , and at least one processor 2302 .

[0297] The memory 2301 is used to store computer programs executed by the processor 2302. The memory 2301 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system and programs required for running the instant messaging function, etc.; the data storage area may store various instant messaging information and operation instruction sets, etc.

[0298] The memory 2301 may be a volatile memory, such as a random-access memory (RAM); the memory 2301 may also be a non-volatile memory, such as a read-only memory, a flash memory, a hard disk drive (HDD) or a solid-state drive (SSD); or the memory 2301 may be any other medium that can be used to carry or store a desired computer program in the form of instructions or data structures and can be accessed by a computer, but is not limited thereto. The memory 2301 may be a combination of the above memories.

[0299] The processor 2302 may include one or more central processing units (CPU) or a digital processing unit, etc. The processor 2302 is configured to implement the above method for determining the number of consecutive completions when calling the computer program stored in the memory 2301 .

[0300] The communication module 2303 is used to communicate with terminal devices and other servers.

[0301] The specific connection medium between the memory 2301, the communication module 2303 and the processor 2302 is not limited in the embodiment of the present application. Fig.23 In the embodiment, the memory 2301 and the processor 2302 are connected via a bus 2304. The bus 2304 is connected to the processor 2302 via a bus 2304. Fig.23 The connections between the other components are described with bold lines, which are only for illustrative purposes and are not intended to be limiting. The bus 2304 can be divided into an address bus, a data bus, a control bus, etc. For ease of description, Fig.23 The diagram shows that only one thick line is used, but this does not mean that there is only one bus or only one type of bus.

[0302] The memory 2301 stores a computer storage medium, and the computer storage medium stores computer executable instructions, and the computer executable instructions are used to implement the method for determining the number of consecutive completions in the embodiment of the present application. The processor 2302 is used to execute the above method for determining the number of consecutive completions.

[0303] In another embodiment, the computing device may also be other computing devices, such as Figure 1 In this embodiment, the structure of the computing device can be as follows: Fig.24 As shown, it includes: a communication component 2410, a memory 2420, a display unit 2430, a camera 2440, a sensor 2450, an audio circuit 2460, a Bluetooth module 2470, a processor 2480 and other components.

[0304] The communication component 2410 is used to communicate with the server. In some embodiments, a wireless fidelity (WiFi) module may be included. The WiFi module belongs to a short-range wireless transmission technology. The electronic device can help the object to send and receive information through the WiFi module.

[0305] The memory 2420 can be used to store software programs and data. The processor 2480 executes various functions and data processing of the terminal device 240 by running the software programs or data stored in the memory 2420. The memory 2420 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one disk storage device, a flash memory device, or other volatile solid-state storage device. The memory 2420 stores an operating system that enables the terminal device 120 to run. In the present application, the memory 2420 can store an operating system and various application programs, and can also store a computer program for executing the method for determining the number of consecutive completions of the embodiment of the present application.

[0306] The display unit 2430 may also be used to display information input by the object or information provided to the object and a graphical user interface (GUI) of various menus of the terminal device 120. Specifically, the display unit 2430 may include a display screen 2432 disposed on the front of the terminal device 120. The display screen 2432 may be configured in the form of a liquid crystal display, a light emitting diode, etc. The display unit 2430 may be used to display the continuous task completion interface, the output interface of each completion number, etc. in the embodiment of the present application.

[0307] The display unit 2430 can also be used to receive input digital or character information, and generate signal input related to the object setting and function control of the terminal device 120. Specifically, the display unit 2430 may include a touch screen 2431 arranged on the front of the terminal device 120, which can collect touch operations of objects on or near it, such as clicking a button, dragging a scroll box, etc.

[0308] The touch screen 2431 can be covered on the display screen 2432, or the touch screen 2431 and the display screen 2432 can be integrated to realize the input and output functions of the physical terminal device 120. The integrated display screen can be referred to as a touch display screen. In this application, the display unit 2430 can display the application and the corresponding operation steps.

[0309] The camera 2440 can be used to capture static images, and the subject can publish the images taken by the camera 2440 through the application. The camera 2440 can be one or more. The object generates an optical image through the lens and projects it onto the photosensitive element. The photosensitive element can be a charge coupled device (CCD) or a complementary metal-oxide-semiconductor (CMOS) phototransistor. The photosensitive element converts the optical signal into an electrical signal, and then passes the electrical signal to the processor 2480 to convert it into a digital image signal.

[0310] The physical terminal device may also include at least one sensor 2450, such as an acceleration sensor 2451, a distance sensor 2452, a fingerprint sensor 2453, and a temperature sensor 2454. The terminal device may also be configured with other sensors such as a gyroscope, a barometer, a hygrometer, a thermometer, an infrared sensor, a light sensor, and a motion sensor.

[0311] The audio circuit 2460, the speaker 2461, and the microphone 2462 can provide an audio interface between the object and the terminal device 120. The audio circuit 2460 can transmit the electrical signal converted from the received audio data to the speaker 2461, which is converted into a sound signal for output. The physical terminal device 120 can also be configured with a volume button for adjusting the volume of the sound signal. On the other hand, the microphone 2462 converts the collected sound signal into an electrical signal, which is received by the audio circuit 2460 and converted into audio data, and then the audio data is output to the communication component 2410 to be sent to, for example, another physical terminal device 240, or the audio data is output to the memory 2420 for further processing.

[0312] The Bluetooth module 2470 is used to exchange information with other Bluetooth devices having Bluetooth modules through the Bluetooth protocol. For example, the physical terminal device can establish a Bluetooth connection with a wearable electronic device (such as a smart watch) that also has a Bluetooth module through the Bluetooth module 2470 to exchange data.

[0313] The processor 2480 is the control center of the physical terminal device. It uses various interfaces and lines to connect various parts of the entire terminal. It executes various functions of the terminal device and processes data by running or executing software programs stored in the memory 2420 and calling data stored in the memory 2420. In some embodiments, the processor 2480 may include one or more processing units; the processor 2480 may also integrate an application processor and a baseband processor, wherein the application processor mainly processes the operating system, user interface, and application programs, and the baseband processor mainly processes wireless communications. It is understandable that the above-mentioned baseband processor may not be integrated into the processor 2480. In the present application, the processor 2480 can run the operating system, application program, user interface display and touch response, as well as the method for determining the number of consecutive completions of the embodiment of the present application. In addition, the processor 2480 is coupled to the display unit 2430.

[0314] In some possible implementations, various aspects of the method for determining the number of consecutive completions provided in the present application may also be implemented in the form of a program product, which includes a computer program. When the program product is run on a computing device, the computer program is used to enable the computing device to execute the steps of the method for determining the number of consecutive completions according to various exemplary implementations of the present application described above in this specification.

[0315] The program product may use any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. The readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of readable storage media (a non-exhaustive list) include: an electrical connection with one or more wires, a portable disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above.

[0316] The program product of the embodiment of the present application may adopt a portable compact disk read-only memory (CD-ROM) and include a computer program, and can be run on an electronic device. However, the program product of the present application is not limited thereto, and in this document, a readable storage medium may be any tangible medium containing or storing a program, which can be used by or in combination with a command execution system, apparatus, or device.

[0317] A readable signal medium may include a data signal propagated in baseband or as part of a carrier wave, wherein a readable computer program is carried. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing. A readable signal medium may also be any readable medium other than a readable storage medium, which may send, propagate, or transmit a program for use by or in conjunction with a command execution system, apparatus, or device.

[0318] The computer program embodied on the readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

[0319] The computer program for performing the operations of the present application may be written in any combination of one or more programming languages, including object-oriented programming languages ​​such as Java, C++, etc., and conventional procedural programming languages ​​such as "C" or similar programming languages. The computer program may be executed entirely on the user's computer device, partially on the user's computer device, as a separate software package, partially on the user's computer device and partially on a remote computer device, or entirely on the remote computer device. In the case of a remote computer device, the remote computer device may be connected to the user's computer device through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer device (e.g., via the Internet using an Internet service provider).

[0320] It should be noted that, although several units or subunits of the device are mentioned in the above detailed description, this division is merely exemplary and not mandatory. In fact, according to the embodiments of the present application, the features and functions of two or more units described above can be embodied in one unit. Conversely, the features and functions of one unit described above can be further divided into multiple units to be embodied.

[0321] In addition, although the operations of the method of the present application are described in a specific order in the drawings, this does not require or imply that the operations must be performed in this specific order, or that all the operations shown must be performed to achieve the desired results. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step, and / or one step may be decomposed into multiple steps.

[0322] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented in one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that include computer-usable program code.

[0323] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0324] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0325] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0326] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to include these modifications and variations.

Claims

1. A method for determining the number of consecutive completions, characterized in that: include: In the process of the target object completing the continuous task, in response to the supplementary task triggered by the target object, a historical timestamp sequence generated based on the completion status of the continuous task is obtained, and a timestamp to be inserted corresponding to the supplementary task is obtained; wherein each historical timestamp corresponds to a completion status of the continuous task, and the historical timestamp sequence includes: a target vacancy corresponding to the supplementary task; Traverse the historical timestamp sequence, and after the traversal is completed, output the final accumulated number of consecutive target completions, wherein each time it is read, the following operations are performed: If the currently read historical timestamp is not the target timestamp, then the currently accumulated number of consecutive completions is updated, and the target timestamp is: the first historical timestamp in the historical timestamp sequence that is later than the timestamp to be inserted; If the historical timestamp is the target timestamp, the timestamp to be inserted is used as a new historical timestamp, inserted into the target space before the historical timestamp, and the currently accumulated number of consecutive completions is updated.

2. The method according to claim 1, characterized in that If the currently read historical timestamp is not the target timestamp, the currently accumulated number of consecutive completions is updated, including: If the currently read historical timestamp is not the target timestamp, and the historical timestamp is the first historical timestamp in the historical timestamp sequence, then the currently accumulated number of consecutive completions is initialized to 1; If the historical timestamp is not the target timestamp, and the historical timestamp is not the first historical timestamp, then based on the historical timestamp and the last historical timestamp read, determine the first continuous relationship between the historical timestamp and the last historical timestamp, and based on the first continuous relationship, update the currently accumulated number of continuous completions.

3. The method according to claim 2, characterized in that The determining, based on the historical timestamp and the read last historical timestamp, a continuous relationship between the historical timestamp and the last historical timestamp includes: Based on the previous historical timestamp, determining the time period in which the previous historical timestamp exists; If the historical timestamp is within the time period between the end time of the time period and the end time of the next time period, determining that the first continuous relationship between the historical timestamp and the previous historical timestamp is continuous; If the historical timestamp is not within the time period between the end time of the time period and the end time of the next period, it is determined that the first continuous relationship between the historical timestamp and the previous historical timestamp is discontinuous.

4. The method according to claim 2, characterized in that The updating of the currently accumulated number of consecutive completions based on the first continuous relationship includes: If the first continuous relationship is continuous, then the current accumulated number of consecutive completions is increased by 1; If the first continuous relationship is discontinuous, the currently accumulated number of consecutive completions is reset to 1.

5. The method according to any one of claims 1 to 4, characterized in that: If the historical timestamp is the target timestamp, the timestamp to be inserted is used as a new historical timestamp, inserted into the target space before the historical timestamp, and the current accumulated number of consecutive completions is updated, including: When the historical timestamp is the target timestamp, the timestamp to be inserted is used as a new historical timestamp and inserted into the target space before the historical timestamp; If the historical timestamp is not the first historical timestamp in the historical timestamp sequence, updating the currently accumulated number of consecutive completions based on the second continuous relationship between the timestamp to be inserted and the last historical timestamp read, and the third continuous relationship between the timestamp to be inserted and the historical timestamp; If the historical timestamp is the first historical timestamp in the historical timestamp sequence, the currently accumulated number of consecutive completions is updated based on a fourth continuous relationship between the timestamp to be inserted and the historical timestamp.

6. The method according to claim 5, characterized in that The updating of the currently accumulated number of consecutive completions based on the second continuous relationship between the time stamp to be inserted and the last historical time stamp read, and the third continuous relationship between the time stamp to be inserted and the historical time stamp, comprises: If the second continuous relationship is continuous and the third continuous relationship is continuous, then the current accumulated number of continuous completions is increased by 2; If the second continuous relationship is discontinuous and the third continuous relationship is continuous, the current accumulated number of consecutive completions is set to 2; If the second continuous relationship is discontinuous and the third continuous relationship is discontinuous, the currently accumulated number of continuous completions is set to 1, and 1 is used as the number of continuous completions corresponding to the time stamp to be inserted; If the second continuous relationship is continuous and the third continuous relationship is discontinuous, the current accumulated continuous completion number is increased by 1 as the continuous completion number corresponding to the time stamp to be inserted, and the current accumulated continuous completion number is set to 1.

7. The method according to claim 5, characterized in that The updating of the currently accumulated number of consecutive completions based on the fourth continuous relationship between the time stamp to be inserted and the historical time stamp includes: If the fourth continuous relationship is continuous, the current accumulated number of consecutive completions is set to 2; If the fourth continuous relationship is discontinuous, the currently accumulated number of continuous completions is set to 1, and 1 is used as the number of continuous completions corresponding to the time stamp to be inserted.

8. The method according to any one of claims 1 to 4, characterized in that: The traversing of the historical timestamp sequence and outputting the final accumulated number of consecutive completions of the target after the traversal is completed include: The current accumulated number of consecutive completions after the last reading is used as the target number of consecutive completions and outputted; If the continuous relationship between the target timestamp and the timestamp to be inserted is continuous, and there is no reset timestamp in the historical timestamp sequence, the target continuous completion number is used as the continuous completion number corresponding to the timestamp to be inserted, and the reset timestamp is: a historical timestamp in the historical timestamp sequence that is discontinuous with the previous historical timestamp after the target timestamp; If the continuity relationship between the target timestamp and the timestamp to be inserted is continuous, and the reset timestamp exists in the historical timestamp sequence, the current accumulated continuous completion count corresponding to the previous historical timestamp of the reset timestamp is used as the continuous completion count corresponding to the timestamp to be inserted.

9. The method according to any one of claims 1 to 4, characterized in that: After traversing the historical timestamp sequence and outputting the final accumulated number of consecutive completions of the target after the traversal is completed, the method further includes: After the traversal is completed, if the timestamp to be inserted has not been inserted into the historical timestamp sequence, inserting the timestamp to be inserted into the target vacancy after the last historical timestamp included in the historical timestamp sequence; Based on the fifth continuous relationship between the timestamp to be inserted and the last historical timestamp, the target continuous completion number is updated, and the updated target continuous completion number is used as the continuous completion number corresponding to the timestamp to be inserted; The cumulative number of completions corresponding to the continuous tasks is increased by 1, and each number of completions is output.

10. A device for determining the number of consecutive completions, characterized in that: include: An acquisition module is used to acquire a historical timestamp sequence generated based on the completion status of the continuous tasks in response to the supplementary tasks triggered by the target object during the process of the target object completing the continuous tasks, and acquire a to-be-inserted timestamp corresponding to the supplementary tasks; wherein each historical timestamp corresponds to a completion status of the continuous tasks, and the historical timestamp sequence includes: a target vacancy corresponding to the supplementary tasks; The first processing module is used to traverse the historical timestamp sequence and output the final accumulated number of consecutive target completions after the traversal is completed, wherein each time the sequence is read, the following operations are performed: If the currently read historical timestamp is not the target timestamp, then the currently accumulated number of consecutive completions is updated, and the target timestamp is: the first historical timestamp in the historical timestamp sequence that is later than the insertion timestamp; If the historical timestamp is the target timestamp, the timestamp to be inserted is used as a new historical timestamp, inserted into the target space before the historical timestamp, and the currently accumulated number of consecutive completions is updated.

11. An electronic device, characterized in that: It comprises a processor and a memory, wherein the memory stores program codes, and when the program codes are executed by the processor, the processor executes the steps of the method according to any one of claims 1 to 9.

12. A computer-readable storage medium, characterized in that: The method comprises a program code, and when the program code is run on a computing device, the program code is used to make the computing device execute the steps of the method according to any one of claims 1 to 9.

13. A computer program product, characterized in that The invention comprises a computer program, which implements the steps of the method according to any one of claims 1 to 9 when being executed by a processor.

Images