Method, apparatus, computer device, and storage medium for recalling virtual prizes

Abstract

The present application relates to a method, device, computer device, and storage medium for recalling virtual prizes. The method includes: receiving a prize recall request carrying a task identifier; looking up a matching prize recall linked list based on the task identifier; the prize recall linked list is a linked list formed with the task identifier of the target prize receiving task as the index node and each specified participation period of the target prize receiving task as the time node; obtaining a target time node in the prize recall linked list; the target specified participation period corresponding to the target time node is a historical period in which the target prize receiving task has not been completed; recalling virtual prizes that match the target prize receiving task within the target specified participation period. Using this method can improve the virtual prize receiving rate in the prize receiving task.

Description

Technical Field

[0001] The present application relates to the field of Internet technologies, and in particular, to a method, device, computer device, and storage medium for recalling virtual prizes. Background Art

[0002] In some virtual interaction scenarios, users need to complete the prize collection tasks held within a specified period, so as to obtain corresponding virtual prizes. Users can use these virtual prizes or exchange virtual items through these virtual prizes for interaction in the virtual interaction scenarios, thereby improving the interaction effect in the virtual interaction scenarios.

[0003] However, users may forget or have no time to complete the prize collection tasks within the specified period, and then will miss the virtual prizes of these prize collection tasks. For example, in the daily check-in task in the virtual interaction scenario, if a user misses the check-in on a certain date, the virtual prize for the check-in on that date will be missed; another example is the game task on a specified date in the virtual interaction scenario. If a user misses the game task on that specified date, the virtual prize for the game task within that specified date will be missed. Therefore, the collection rate of virtual prizes for prize collection tasks will be low. Summary of the Invention

[0004] Based on this, in view of the above technical problems, it is necessary to provide a method, device, computer device, and storage medium for recalling virtual prizes, which can improve the collection rate of virtual prizes in prize collection tasks.

[0005] A method for recalling virtual prizes, the method includes:

[0006] Receiving a prize recall request carrying a task identifier;

[0007] Searching for a matching prize recall linked list based on the task identifier; the prize recall linked list is a linked list formed with the task identifier of the target prize collection task as the index node and each specified participation period of the target prize collection task as the time node;

[0008] Obtaining a target time node in the prize recall linked list; the target specified participation period corresponding to the target time node is a historical period in which the target prize collection task has not been completed;

[0009] Recalling virtual prizes matching the target prize collection task within the target specified participation period.

[0010] In one of the embodiments, the prize recall linked list includes a second prize recall sub-linked list corresponding to the second prize collection sub-task; the method further includes:

[0011] When the second prize collection subtask is overdue within the target specified participation period, delete the target time node from the second prize recall sub-linked list; or,

[0012] In the second prize recall sub-linked list, mark the target time node as a state where recall is prohibited.

[0013] A virtual prize recall device, the device includes:

[0014] A receiving module, configured to receive a prize recall request carrying a task identifier;

[0015] A searching module, configured to search for a matching prize recall linked list based on the task identifier; the prize recall linked list is a linked list formed with the task identifier of the target prize collection task as the index node and each specified participation period of the target prize collection task as the time node;

[0016] An obtaining module, configured to obtain a target time node in the prize recall linked list; the target specified participation period corresponding to the target time node is a historical period when the target prize collection task was not completed;

[0017] A recall module, configured to recall a virtual prize that matches the target prize collection task within the target specified participation period.

[0018] In one embodiment, the device further includes:

[0019] The receiving module is further configured to receive a prize collection request sent by a terminal and carrying the task identifier and the task completion time;

[0020] The searching module is further configured to, in response to the prize collection request, search for the matching prize recall linked list according to the task identifier, and search for a time node in the prize recall linked list that matches the task completion time;

[0021] A first processing module, configured to delete the matching time node from the prize recall linked list; or, in the prize recall linked list, mark the matching time node as a state where recall is prohibited.

[0022] In one embodiment, the device further includes:

[0023] The receiving module is further configured to receive a prize recall system login request sent by a terminal;

[0024] The searching module is further configured to search for a prize recall linked list set according to the user identifier in the prize recall system login request;

[0025] A first sending module, configured to send the task identifiers of the prize collection tasks in the prize recall linked list set to the terminal, so that the terminal displays the task identifiers of the prize collection tasks on the prize recall page of the prize recall system.

[0026] In one embodiment, the prize recall page includes recall buttons for each of the prize collection tasks; the target prize collection task belongs to the prize collection tasks; the prize recall request is a request generated by the terminal in response to triggering the recall button for the target prize collection task.

[0027] In one embodiment, the recall button includes a first-type recall button and a second-type recall button; the apparatus further includes:

[0028] A deduction module, configured to, when the prize recall request is a request generated by triggering the first-type recall button, deduct a first amount of virtual resources from the user account corresponding to the terminal; when the prize recall request is a request generated by triggering the second-type recall button, deduct a second amount of virtual resources from the user account corresponding to the terminal;

[0029] wherein, the first amount is greater than the second amount; the quantity and value of the virtual prizes recalled based on the first-type recall button are respectively greater than the quantity and value of the virtual prizes recalled based on the first-type recall button.

[0030] In one embodiment, the apparatus further includes:

[0031] A second processing module, configured to delete the target time node from the prize recall linked list; or, mark the target time node as a prohibited recall state in the prize recall linked list.

[0032] In one embodiment, the prize recall request is a request generated by the terminal in response to triggering the recall button for the target prize collection task; the obtaining module is further configured to obtain the receiving time or generation time of the prize recall request; obtain the effective time corresponding to the target prize collection task within the target specified participation period;

[0033] The recall module is further configured to, when the receiving time or the generation time is within the range of the effective time, recall the virtual prizes matching the target prize collection task within the target specified participation period.

[0034] In one embodiment, the target prize collection task includes a first prize collection sub-task and a second prize collection sub-task;

[0035] The recall module is further configured to recall virtual prizes matching the first prize collection subtask when the first prize collection subtask is not completed within the target specified participation period; and stop recalling virtual prizes matching the second prize collection subtask when the second prize collection subtask is completed beyond the target specified participation period.

[0036] In one embodiment, the prize recall linked list includes a second prize recall sub-linked list corresponding to the second prize collection subtask; the apparatus further includes:

[0037] A third processing module, configured to delete the target time node from the second prize recall sub-linked list when the second prize collection subtask is completed beyond the target specified participation period; or mark the target time node as a prohibited recall state in the second prize recall sub-linked list.

[0038] In one embodiment, the apparatus further includes:

[0039] A generation module, configured to generate a target prize collection task within the target specified participation period according to the target time node;

[0040] A second sending module, configured to send the target prize collection task to the terminal to display the target prize collection task on the task operation page of the terminal;

[0041] The recall module is further configured to recall virtual prizes matching the target prize collection task within the target specified participation period when receiving a completion instruction for the target prize collection task returned by the terminal.

[0042] A computer device includes a memory and a processor, the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0043] Receive a prize recall request carrying a task identifier;

[0044] Find a matching prize recall linked list based on the task identifier; the prize recall linked list is a linked list formed with the task identifier of the target prize collection task as the index node and each specified participation period of the target prize collection task as the time node;

[0045] Obtain a target time node in the prize recall linked list; the target specified participation period corresponding to the target time node is a historical period in which the target prize collection task is not completed;

[0046] Recall virtual prizes matching the target prize collection task within the target specified participation period.

[0047] A computer-readable storage medium stores a computer program thereon, and when the computer program is executed by a processor, the following steps are implemented:

[0048] Receive a prize recall request carrying a task identifier;

[0049] Based on the task identifier, find a matching prize recall linked list; the prize recall linked list is a linked list formed with the task identifier of the target prize collection task as the index node and each specified participation period of the target prize collection task as the time node;

[0050] Obtain a target time node in the prize recall linked list; the target specified participation period corresponding to the target time node is a historical period during which the target prize collection task was not completed;

[0051] Recall virtual prizes that match the target prize collection task within the target specified participation period.

[0052] The above virtual prize recall method, device, computer device, and storage medium, when receiving a prize recall request, find a matching prize recall linked list based on the task identifier in the prize recall request, then obtain the time node corresponding to the target specified participation period during which the target prize collection task was not completed in the prize recall linked list, and then recall virtual prizes that match the target prize collection task during this historical period, thus realizing the re-collection of missed virtual prizes and improving the collection rate of virtual prizes. In addition, the prize recall linked list constructed with the task identifier of the target prize collection task as the index node and each specified participation period of the target prize collection task as the time node can quickly find the target specified participation period corresponding to the target prize collection task that the user did not complete, and then recall virtual prizes that match the target prize collection task within the target specified participation period, improving the recall efficiency of virtual prizes.

[0053] A method for recalling virtual prizes, the method comprising:

[0054] Display the task identifiers of each prize collection task that was not completed during the target specified participation period;

[0055] At the display position corresponding to the task identifier, display a recall button and a prize identifier for the prize collection task;

[0056] In response to a prize recall operation triggered on the recall button of the target prize collection task, display the recall result of the virtual prize that matches the prize identifier;

[0057] Among them, the target prize collection task belongs to the prize collection task; the virtual prize is recalled at the target time node in the prize recall linked list found by matching based on the task identifier; the prize recall linked list is a linked list formed with the task identifier of the target prize collection task as the index node and each specified participation period of the target prize collection task as the time node.

[0058] A device for recalling virtual prizes, the device includes:

[0059] A display module, configured to display the task identifiers of each uncompleted prize collection task within a target specified participation period;

[0060] A first display module, configured to display a recall button and a prize identifier of the prize collection task at a display position corresponding to the task identifier;

[0061] A second display module, configured to display a recall result of a virtual prize matching the prize identifier in response to a prize recall operation triggered on the recall button of the target prize collection task;

[0062] Among them, the target prize collection task belongs to the prize collection task; the virtual prize is recalled at the target time node in the prize recall linked list found by matching based on the task identifier; the prize recall linked list is a linked list formed with the task identifier of the target prize collection task as the index node and each specified participation period of the target prize collection task as the time node.

[0063] In one of the embodiments, the recall button includes a first type of recall button and a second type of recall button;

[0064] The second display module is further configured to display a recall result of all virtual prizes matching the prize identifier in response to a prize recall operation triggered on the first type of recall button of the target prize collection task; and display a recall result of partial virtual prizes matching the prize identifier in response to a prize recall operation triggered on the second type of recall button of the target prize collection task.

[0065] A computer device includes a memory and a processor, the memory stores a computer program, and when the processor executes the computer program, the following steps are implemented:

[0066] Display the task identifiers of each uncompleted prize collection task within a target specified participation period;

[0067] At a display position corresponding to the task identifier, display a recall button and a prize identifier of the prize collection task;

[0068] In response to a prize recall operation triggered on the recall button of the target prize collection task, display the recall result of the virtual prize that matches the prize identifier;

[0069] Wherein, the target prize collection task belongs to the prize collection task; the virtual prize is recalled at a target time node in a prize recall linked list found to match based on the task identifier; the prize recall linked list is a linked list formed with the task identifier of the target prize collection task as the index node and each specified participation period of the target prize collection task as the time nodes.

[0070] A computer-readable storage medium, on which a computer program is stored, and when the computer program is executed by a processor, the following steps are implemented:

[0071] Display the task identifiers of each uncompleted prize collection task within a target specified participation period;

[0072] At the display position corresponding to the task identifier, display the recall button and prize identifier of the prize collection task;

[0073] In response to a prize recall operation triggered on the recall button of the target prize collection task, display the recall result of the virtual prize that matches the prize identifier;

[0074] Wherein, the target prize collection task belongs to the prize collection task; the virtual prize is recalled at a target time node in a prize recall linked list found to match based on the task identifier; the prize recall linked list is a linked list formed with the task identifier of the target prize collection task as the index node and each specified participation period of the target prize collection task as the time nodes.

[0075] The above method, device, computer device and storage medium for recalling virtual prizes, when it is necessary to recall virtual prizes, display the task identifiers of each uncompleted prize collection task within a target specified participation period, and display the recall button and prize identifier of the prize collection task, so that users can select the virtual prizes of the target prize collection task for recall in real time, thereby realizing the re-collection of missed virtual prizes and improving the collection rate of virtual prizes. In addition, the prize recall linked list constructed with the task identifier of the target prize collection task as the index node and each specified participation period of the target prize collection task as the time nodes can quickly find the target specified participation period corresponding to the target prize collection task that the user has not completed, and then recall the virtual prize that matches the target prize collection task within the target specified participation period, improving the recall efficiency of virtual prizes. BRIEF DESCRIPTION OF THE DRAWINGS

[0076] Figure 1 It is an application environment diagram of the method for recalling virtual prizes in an embodiment;

[0077] Figure 2 Schematic flowchart of the method for recalling virtual prizes in one embodiment;

[0078] Figure 3 Schematic diagram of the prize recall chain in one embodiment;

[0079] Figure 4 Schematic diagram for marking time nodes in the prize recall chain in one embodiment;

[0080] Figure 5 Schematic diagram for finding the prize recall chain and marking time nodes in the prize recall chain in one embodiment;

[0081] Figure 6 Schematic flowchart of the method for recalling virtual prizes in another embodiment;

[0082] Figure 7 Schematic diagram of the interface of the prize recall page in one embodiment;

[0083] Figure 8 Schematic diagram for processing time nodes in the prize recall chain when logging in to the prize retrieval system in one embodiment;

[0084] Figure 9 Schematic diagram for finding the prize recall chain and marking time nodes in the prize recall chain in another embodiment;

[0085] Figure 10 Schematic flowchart of the method for recalling virtual prizes in another embodiment;

[0086] Figure 11 Schematic diagram of the prize recall chain in another embodiment;

[0087] Figure 12 Schematic flowchart of the method for recalling virtual prizes in another embodiment;

[0088] Figure 13 Structure block diagram of the virtual prize recall device in one embodiment;

[0089] Figure 14 Structure block diagram of the virtual prize recall device in another embodiment;

[0090] Figure 15 Structure block diagram of the virtual prize recall device in another embodiment;

[0091] Figure 16 Internal structure diagram of a computer device in one embodiment;

[0092] Figure 17It is the internal structure diagram of a computer device in another embodiment. Detailed implementation manners

[0093] In order to make the objectives, technical solutions and advantages of the present application more clear and understandable, the present application will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0094] The virtual prize recall method provided by the present application can be applied to an application environment as Figure 1 shown. In this application environment, it includes a terminal 102 and a server 104. When a virtual prize needs to be recalled, the terminal 102 displays a prize recall page for the virtual prize. Among them, task identifiers of each uncompleted prize collection task within a target specified participation period can be displayed on the prize recall page, such as Figure 1 "First task", "Second task", and "Third task" in. When a recall button for a target prize collection task is detected, such as detecting that the user clicks the "Perfect recall" button for the "Third task", the terminal 102 will generate a prize recall request carrying the task identifier of the target prize collection task, and send the prize recall request to the server 104. It should be noted that the above recall refers to: retrieving the virtual prize of the prize collection task that has not been participated in or completed within the specified participation period. For example, for the daily check-in task, if the user does not check in on a certain day (assuming this day is Day0), at this time, the virtual prize of the Day0 check-in task needs to be retrieved.

[0095] When the server 104 receives the prize recall request sent by the terminal 102, it searches for a matching prize recall linked list based on the task identifier carried in the prize recall request; among them, the prize recall linked list is a linked list formed with the task identifier of the target prize collection task as the index node and each specified participation period of the target prize collection task as the time node; obtain a target time node in the prize recall linked list; the target specified participation period corresponding to the target time node is the historical period when the target prize collection task was not completed; recall the virtual prize that matches the target prize collection task within the target specified participation period. Then, the server 104 sends the recall result of the virtual prize to the terminal 102 so that the terminal 102 can display the recall result.

[0096] Among them, the terminal 102 can be a smart phone, a tablet computer, a notebook computer, a desktop computer, a smart speaker, a smart watch, etc., but is not limited thereto.

[0097] The server 104 can be an independent physical server or a server cluster composed of multiple physical servers, and can be 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 Network (CDN), and big data and artificial intelligence platforms.

[0098] The terminal 102 and the server 104 can be connected through communication connection methods such as Bluetooth, USB (Universal Serial Bus), or network, and the present application does not limit this here.

[0099] In one embodiment, as Figure 2 shown, a method for recalling virtual prizes is provided. Taking the method applied to the Figure 1 server 104 in it as an example, the method includes the following steps:

[0100] S202, receiving a prize recall request carrying a task identifier.

[0101] Among them, the task identifier can be the identifier of the target prize collection task, that is, the target prize collection task can be found through the task identifier; in addition, the corresponding prize recall linked list can be found through the task identifier, so as to recall the virtual prize of the target prize collection task based on the prize recall linked list. Therefore, the task identifier can also be called a recall identifier or a retrieve identifier. Specifically, the task identifier can be the task name of the target prize collection task or other characters, such as numbers, or letters, or a combination of numbers and letters.

[0102] The prize collection task can be a task that can collect virtual prizes in a virtual interaction scenario. For example, the daily check-in task in a virtual interaction scenario, or a game task on a specified date. When the user checks in on the same day, the virtual prize of the check-in task can be obtained; and when the user completes the game task within the specified date, the virtual prize of the game task can be obtained. Correspondingly, the target prize collection task refers to the prize collection task from which the user currently wants to recall the virtual prize. The above virtual interaction scenario can be an application scenario in which virtual characters controlled by different users interact with each other, or a virtual character controlled by a user interacts with a virtual character controlled by a computer program, such as a battle game.

[0103] In addition, the prize recall request can also be called a prize retrieve request, which refers to a trigger instruction used to request the server to recall (recall is also retrieve) the virtual prize. The prize recall request is generated by the terminal when it detects a prize recall operation triggered by the recall button on the prize recall page, and then sent to the server.

[0104] In one embodiment, a prize recall system can be deployed in the server. Through this prize recall system, virtual prizes can be recalled. The prize recall system can be configured with a granularity control interface for external interaction to achieve the interaction between the prize recall system and the terminal. For example, the server can receive a prize recall request carrying a task identifier sent by the terminal through the granularity control interface, so that the prize recall system can recall virtual prizes according to the task identifier in the prize recall request. In addition, the granularity control interface can be used to determine the granularity of the virtual prizes to be recalled this time, such as recalling a part of the virtual prizes or all of the virtual prizes. Therefore, the prize recall system in the server and the terminal can achieve interaction through the granularity control interface. Regardless of the type of prize collection task, as long as the server receives a prize recall request carrying a task identifier sent by the terminal, it can complete the subsequent recall of virtual prizes, which is beneficial to improving the efficiency of virtual prize recall. In addition, the granularity of virtual prize recall can be controlled through the granularity control interface, enhancing the flexibility of virtual prize recall.

[0105] S204. Search for a matching prize recall linked list based on the task identifier; the prize recall linked list is a linked list formed with the task identifier of the target prize collection task as the index node and the specified participation time periods of the target prize collection task as the time nodes.

[0106] Among them, the prize recall linked list includes two types of nodes. One is the index node, which is a node identified by the task identifier of the target prize collection task; the other is the time node, which is a node identified by the specified participation time periods of the target prize collection task, and the number of its nodes can be the same as the number of time periods of the specified participation time periods, that is, if the number of time periods of the specified participation time periods is n, the number of time nodes can also be n. In the prize recall linked list, the index node can be the root node, and the time node can be the child node connecting the root node. By setting up the prize recall linked list, the management of all unfinished target prize collection tasks can be realized, and the virtual prizes of various types of prize collection tasks can be managed through this prize recall linked list, improving the flexibility of virtual prize recall.

[0107] The above-mentioned specified participation time period refers to the time period when the user is specified to participate in the target prize collection task. Generally speaking, each target prize collection task has a specified participation time. For example, the daily sign-in task is usually participated in the time period from 0:00 to 23:59 on the same day D0. When exceeding the time period from 0:00 to 23:59 on D0 (such as reaching the next day), if you want to receive the virtual prize for the sign-in task on D0, you need to perform virtual prize operations.

[0108] In one embodiment, the prize recall linked lists corresponding to each prize collection task can be connected to each other. For example, by connecting each index node, a set of prize recall linked lists is formed. Thus, when a prize recall request is received, traversal can be performed in this set of prize recall linked lists to find a matching prize recall linked list. In addition, through this set of prize recall linked lists, unified management of all prize recall linked lists can be achieved. For example, as Figure 3 shown, the index nodes in different prize recall linked lists a to c can be connected, that is, the index nodes corresponding to task identifiers 1 to 3 are connected, thereby obtaining a set of prize recall linked lists.

[0109] Continuing with the above embodiment, S204 may specifically include: after receiving a prize recall request, the server can obtain the set of prize recall linked lists, and then search for a matching prize recall linked list in the set of prize recall linked lists according to the task identifier.

[0110] S206, obtain a target time node in the prize recall linked list; the target specified participation period corresponding to the target time node is the historical period when the target prize collection task was not completed.

[0111] Among them, the time nodes in the prize recall linked list may include the nodes corresponding to the specified participation periods of the completed target collection tasks, and the nodes corresponding to the specified participation periods of the uncompleted target collection tasks. For example, for the daily sign-in task, there are a total of seven sign-in tasks in a week. If the user did not sign in from Monday to Friday but signed in on Saturday and Sunday, then the time nodes 1 to 5 corresponding to Monday to Friday respectively are the nodes corresponding to the time when the user did not sign in, and the time nodes 6 to 7 corresponding to Saturday and Sunday respectively are the nodes corresponding to the time when the user signed in.

[0112] The above target time node is the node corresponding to the specified participation period when the target collection task was not completed. For example, if the time nodes 1 to 5 corresponding to Monday to Friday respectively are the nodes corresponding to the time when the user did not sign in, then the time nodes 1 to 5 are the target time nodes.

[0113] In one embodiment, in the prize recall linked list, the time nodes corresponding to the completed target prize collection tasks are marked as the prohibited recall state. For example, for the daily sign-in task, assume that today is Sunday and the user signed in on Sunday and performed a virtual prize recall operation for Saturday. Then, in the prize recall linked list, the time nodes corresponding to Sunday and Saturday are marked as the prohibited recall state. As Figure 4 shown, Figure 4 the time nodes corresponding to Sunday and Saturday in are gray, indicating that these two time nodes are marked as the prohibited recall state. Therefore, the virtual prizes for the sign-in tasks on Saturday and Sunday will be prohibited from being recalled. Among them, Figure 4The time nodes corresponding to Monday to Friday are white, indicating that the virtual prizes for the sign-in tasks from Monday to Friday can be recalled.

[0114] Continuing with the above embodiment, S206 may specifically include: The server searches for time nodes in the prize recall linked list that are not marked as in the prohibited recall state, and uses the found time node as the target time node; alternatively, the server deletes the time nodes marked as in the prohibited recall state in the prize recall linked list, so that the remaining time nodes are the target time nodes.

[0115] S208, recall the virtual prize that matches the target prize collection task within the target specified participation period.

[0116] Among them, the virtual prize can be virtual numerical resources or virtual items. The virtual numerical resources can be virtual diamonds, gold coins, experience points, etc.; the virtual items can be weapons or vehicles with attack and defense capabilities, and the virtual items can also be decorations or clothing for dressing up the virtual object controlled by the user.

[0117] In one embodiment, recall the virtual prize that matches the target prize collection task within the target specified participation period from the virtual prize pool. Among them, the virtual prize pool stores the virtual prizes corresponding to each prize collection task, and the virtual prizes corresponding to different types of prize collection tasks are different.

[0118] In addition, the virtual prize can be related not only to the prize collection task but also to the user's level in the virtual interaction scenario. S208 may specifically include: The server recalls the virtual prize that matches the target prize collection task within the target specified participation period from the virtual prize pool, and then obtains the virtual prize that matches the user's level from the recalled virtual prizes.

[0119] For the recall of virtual prizes, the recall can be carried out in the following two ways:

[0120] Method 1, recall using the target resource.

[0121] Among them, the target resource can be virtual resources or target funds. The virtual resources can be virtual gold coins or special recall vouchers, and the target funds can be cash recharge in the user's account.

[0122] In one embodiment, the server deducts a target quantity of virtual resources from the virtual resource pool in the user account, or deducts a corresponding quantity of dedicated recall vouchers, or deducts a corresponding amount of funds from the funds pool in the user account, and then recalls virtual prizes that match the target prize collection task within the target specified participation period. For example, for the sign-in task, the user can recall the virtual prizes for the sign-in tasks from Monday to Saturday of this week on Sunday. During the recall process, the server will deduct a certain quantity of gold coins accordingly, and then recall the virtual prizes for the sign-in tasks from Monday to Saturday of this week.

[0123] Method 2: Enter the task operation page to execute the target prize collection task to recall the virtual prize.

[0124] In one embodiment, the server generates a target prize collection task within the target specified participation period according to the target time node; sends the target prize collection task to the terminal to display the target prize collection task on the task operation page of the terminal. S208 may specifically include: when receiving a completion instruction for the target prize collection task returned by the terminal, the server recalls the virtual prize that matches the target prize collection task within the target specified participation period.

[0125] For example, assume that the target prize collection task is a game task. When the user misses the game task on XX1st day of MM month in YYYY year, within the valid time of this game task, the user can generate a prize recall request by triggering the recall button on the prize recall page. The server searches the prize recall linked list according to this prize recall request, finds the game task on XX1st day of MM month through the prize recall linked list, then generates this game task and sends it to the terminal, so that the terminal displays this game task on the task operation page for the user to execute this game task and obtain the corresponding prize after completing the game task. In addition, during the process of searching for the game task through the prize recall linked list, the server can obtain the associated tasks related to this game task, and then send the associated tasks and this game task to the terminal together for the user to execute this game task and the associated tasks in sequence. Or, when the specified participation period of the found game task has exceeded the valid time, the server can also only send the associated tasks related to this game task to the terminal, so that the user executes the associated tasks.

[0126] In one embodiment, after S208, the method may further include: the server deletes the target time node from the prize recall linked list; or marks the target time node as a prohibited recall state in the prize recall linked list. For example, assume that it is Sunday currently and the user has signed in on Sunday, and the sign-in tasks from Monday to Saturday have not been completed. If the user currently recalls the virtual prize for the Saturday sign-in task, then the time node corresponding to Saturday is deleted from the prize recall linked list, or the time node corresponding to Saturday is marked as a prohibited recall state. AsFigure 4 As shown, in addition to marking the time nodes corresponding to Sundays in gray (gray indicates the prohibited recall status), the time nodes corresponding to Saturdays are also marked in gray. Through this embodiment, the time nodes corresponding to the recalled virtual prizes can be marked or deleted, so that when recalling again next time, the recalled virtual prizes can be avoided from being recalled again, thus avoiding the problem of duplicate receipt of virtual prizes.

[0127] In the above embodiment, when receiving a prize recall request, based on the task identifier in the prize recall request, a matching prize recall linked list is searched for, and then the time nodes corresponding to the target specified participation periods for the target prize receiving tasks that have not been completed are obtained in the prize recall linked list, and then the virtual prizes matching the target prize receiving tasks within the historical period are recalled, thus realizing the re-receipt of the missed virtual prizes and improving the receipt rate of virtual prizes. In addition, the prize recall linked list constructed with the task identifier of the target prize receiving task as the index node and the respective specified participation periods of the target prize receiving task as the time nodes can quickly find the target specified participation periods corresponding to the target prize receiving tasks that the user has not completed, and then recall the virtual prizes matching the target prize receiving tasks within the target specified participation periods, improving the recall efficiency of virtual prizes.

[0128] In one embodiment, before S202, the method may further include: the server receives a prize receipt request sent by the terminal carrying the task identifier and the task completion time; in response to the prize receipt request, searches for a matching prize recall linked list according to the task identifier, and searches for the time nodes matching the task completion time in the prize recall linked list; deletes the matching time nodes from the prize recall linked list; or, in the prize recall linked list, marks the matching time nodes as the prohibited recall status.

[0129] Among them, the above task identifier may be the identifier of the target prize receiving task. For the prize receipt request, the server may receive the prize receipt request through the granularity control interface.

[0130] For the target prize receiving task, the user can participate in and complete the target prize receiving task within the current specified participation period, so as to receive the virtual prize of the target prize receiving task within the specified participation period, and delete or mark as the prohibited recall status the time nodes corresponding to the specified participation period in the prize recall linked list of the target prize receiving task, so that when recalling virtual prizes, the virtual prizes of the target prize receiving tasks that have been participated in within the specified participation period can be avoided from being recalled, thus avoiding the problem of duplicate receipt of prizes for the same prize receiving task in the same specified participation period.

[0131] For example, for the check-in task, the user can check in on the same day to obtain the virtual prize for the check-in task on that day, and then delete the time node corresponding to the same day in the prize recall linked list of the check-in task, or mark it as a prohibited recall status. As Figure 5 shown, the user checks in through the terminal on the same day (assuming it is time period 1-2), so that the terminal obtains the task identifier 1 of the check-in task and the task completion time for completing the check-in task, generates a prize collection request carrying the task identifier 1 and the task completion time, and sends it to the server through the granularity control interface. The server receives the prize collection request sent by the terminal through the granularity control interface, finds the corresponding prize recall linked list 1 according to the task identifier 1 in the prize collection request, then finds the time node corresponding to the time period 1-2 that matches the task completion time in the prize recall linked list 1, and then marks the time node corresponding to the time period 1-2 as gray. Among them, gray indicates the prohibited retrieval status. The steps of finding the time node corresponding to time period 1-2 include:

[0132] For another example, for the game task, the user can complete the game task within the deadline on the same day, so as to obtain the virtual prize for the game task on that day, and then delete the time node corresponding to the deadline on the same day in the prize recall linked list of the game task, or mark it as a prohibited recall status. As Figure 5 shown, the user performs the game task through the terminal on the same day (assuming it is time period 2-3), and can mark the time node corresponding to time period 2-3 as gray indicating the prohibited retrieval status in a manner similar to the above check-in task.

[0133] In the above embodiments, the time node corresponding to the prize recall task that has been completed during the currently specified participation time period can be deleted or marked as a prohibited recall status, so that when performing the recall, it is possible to avoid recalling the virtual prize of the completed prize collection task, thereby avoiding the problem of duplicate collection of virtual prizes.

[0134] In one embodiment, the above method can be applied to a prize recall system. As Figure 6 shown, before S202, the method further includes:

[0135] S602, receiving a prize recall system login request sent by the terminal.

[0136] Among them, the above-mentioned prize recall request is a request generated by the terminal in response to triggering the recall button for the target prize collection task. After the terminal logs in to the prize recall system, the terminal can display recall buttons for each prize collection task, and the recall buttons include the first type of recall button and the second type of recall button. In addition, the prize recall system can also be referred to as a prize retrieval system, which is used to recall virtual prizes in the missed target prize collection tasks. Next, the first type of recall button and the second type of recall button will be described:

[0137] The first type of recall button can be used to recall all virtual prizes in the target prize collection tasks during each specified participation period. For example, Figure 7 in the "Perfect Recall" button, by clicking the "Perfect Recall" button of "Task 1", all virtual prizes in "Task 1" can be recalled.

[0138] The second type of recall button can be used to recall some virtual prizes in the target prize collection tasks during each specified participation period. For example, Figure 7 in the "Ordinary Recall" button, by clicking the "Ordinary Recall" button of "Task 1", some virtual prizes in "Task 1" can be recalled, such as 70% of the virtual prizes recalled by "Perfect Recall".

[0139] In different prize collection tasks, different types or different numbers of recall buttons can be displayed on the prize recall page of the prize recall system. For example, for prize collection task A, the first type of recall button can be displayed on the prize recall page; while for prize collection task B, the second type of recall button can be displayed on the prize recall page. Or, for prize collection task A, the first type of recall button and the second type of display button can be simultaneously displayed on the prize recall page; while for prize collection task B, only the first type of recall button or the second type of display button can be displayed.

[0140] In addition, for a specific prize collection task, different types or different numbers of recall buttons can be displayed on the prize recall pages of different user sides, such as displaying different types of recall buttons according to different user-related data. For example, for prize collection task C, the first type of button can be displayed on the prize recall page of a member user, or the first type of recall button and the second type of display button can be simultaneously displayed, so that when the member user conducts a recall, all virtual prizes in the prize collection task can be recalled; while only the second type of button is displayed on the prize recall page of a non-member user, so when the non-member user conducts a recall, only some virtual prizes in the prize collection task can be recalled.

[0141] S604. Search for the prize recall linked list set according to the user identification in the prize recall system login request.

[0142] Among them, the user identifier can be the user account or communication signal of the user in the virtual interaction scenario. For example, if the virtual interaction scenario is a battle game, the user identifier can be the user account for logging in to the battle game.

[0143] The above-mentioned prize recall linked list set can be a set composed of each prize recall linked list, including all prize recall linked lists of the prize recall tasks that the user has not participated in. For example, the index nodes in each prize recall linked list that the user has not participated in are connected to obtain the prize recall linked list set.

[0144] In one embodiment, the server reads the user identifier from the prize recall system login request, and then searches for the corresponding prize recall linked list set according to the user identifier. As Figure 8 shown, when the user logs in to the prize recall system through the terminal, the server searches for the prize recall linked list set corresponding to tasks a to c according to the user identifier. The prize recall linked list set includes the prize recall linked list of task a, whose index node is task identifier 1, and the time nodes include time periods 1-1, 1-2, and 1-3; similarly, the prize recall linked list set includes the prize recall linked lists of tasks b and c.

[0145] In one embodiment, after the server finds the prize recall linked list set, it can also delete the time nodes of the prize recall tasks corresponding to the virtual prizes that cannot be recalled from the search prize recall linked list in the search prize recall linked list set, or mark them as the prohibited recall state. Among them, the server can compare the current time with the effective time of each prize recall task. If the current time exceeds the effective time, it means that the virtual prize of the prize recall task cannot be recalled at the current time. At this time, the time node corresponding to the prize recall task can be deleted from the prize recall linked list set, or marked as the prohibited recall state.

[0146] Combined with Figure 8 To illustrate the above embodiment, for task b, the server determines that task b at time period 2-1 has exceeded the effective time according to the current time. At this time, the time node of time period 2-1 can be deleted from the prize recall linked list set, that is, the time node of time period 2-1 is deleted from the prize recall linked list of task b. Therefore, for the obtained prize recall linked list set, the server can recall the virtual prize from the prize collection task in the prize recall linked list set.

[0147] For example, for the daily check-in task, assume the valid time is 7 days. If it exceeds 7 days, recall cannot be performed. For example, a user can recall the virtual prize of the check-in task on Monday this week on Sunday this week, but cannot recall the virtual prizes of the check-in tasks on last Sunday and before last Sunday. Therefore, when the user logs in to the prize recall system on Sunday this week, the server can delete the time nodes corresponding to the period from last Sunday and before from the prize recall linked list set.

[0148] S606. Send the task identifiers of each prize collection task in the prize recall linked list set to the terminal, so that the terminal can display the task identifiers of each prize collection task on the prize recall page of the prize recall system.

[0149] After the server sends the task identifiers of each prize collection task in the prize recall linked list set to the terminal, the terminal can determine the prize collection tasks for which virtual prizes can be recalled, and then display the task identifiers of these prize collection tasks on the prize recall page. For example, Figure 7 as shown, on this prize recall page, the task identifiers "First Task", "Second Task" and "Third Task" of each prize collection task are displayed. In addition, the terminal can also display the icons of the recallable virtual prizes, the number of recallable times and the recall button on this prize recall page; and, it can also display the amount of virtual resources consumed when executing the recall of the virtual prize, such as the number of gold coins consumed; and, it can also display the value of the recallable virtual prize. Thus, the user can judge whether to perform a recall based on this value and the number of gold coins to be consumed.

[0150] The above-mentioned number of recallable times can refer to the number of tasks for which virtual prizes can be recalled in tasks held during different specified participation periods. For example, for the first task, assume that this first task is held on Monday, Wednesday and Friday, and the number of recallable times is 2, which means that the virtual prizes in two of the first tasks held on Monday, Wednesday and Friday can be recalled, such as the virtual prizes in the first tasks held on Wednesday and Friday can be recalled.

[0151] S608. Receive the prize recall request carried by the terminal with the task identifier.

[0152] S610. Search for a matching prize recall linked list based on the task identifier; this prize recall linked list is a linked list formed with the task identifier of the target prize collection task as the index node and the respective specified participation periods of the target prize collection task as the time nodes.

[0153] S612. Obtain the target time node in the prize recall linked list; the target specified participation period corresponding to this target time node is the historical period when the target prize collection task was not completed.

[0154] The specific steps of the above embodiments S608 - S612 can be referred toFigure 2 S202 - S206 in the embodiment.

[0155] S614, recall the virtual prizes that match the target prize collection task within the target specified participation period.

[0156] In one embodiment, the recall button includes a first - type recall button and a second - type recall button; the method further includes: when the prize recall request is a request generated by triggering the first - type recall button, the server deducts a first amount of virtual resources from the user account corresponding to the terminal; when the prize recall request is a request generated by triggering the second - type recall button, a second amount of virtual resources is deducted from the user account corresponding to the terminal; wherein, the first amount is greater than the second amount; the quantity and value of the virtual prizes recalled based on the first - type recall button are respectively greater than the quantity and value of the virtual prizes recalled based on the second - type recall button.

[0157] For example, as Figure 7 shown, when the user selects "perfect recall", all virtual prizes of any one of the "first task", "second task", and "third task" can be recalled, and at this time, the amount of virtual resources deducted is relatively large. When the user selects "ordinary recall", some virtual prizes of any one of the "first task", "second task", and "third task" can be recalled, and at this time, the amount of virtual resources deducted is relatively small.

[0158] In one embodiment, when recalling virtual prizes through the first - type recall button, in addition to using virtual resources (such as gold coins or diamonds), special recall vouchers can also be used for recall. At this time, the server can deduct the user's special recall vouchers without deducting virtual resources.

[0159] In one embodiment, the above - mentioned prize recall request is a request generated by the terminal in response to triggering the recall button for the target prize collection task; the method further includes: the server obtains the reception time or generation time of the prize recall request; obtains the effective time corresponding to the target prize collection task within the target specified participation period; when the reception time or generation time is within the range of the effective time, then execute S614. Thus, the recalled virtual prizes are all virtual prizes of the target prize collection task within the effective time range, and for the target prize collection task beyond the effective time range, virtual prizes cannot be recalled.

[0160] In the above embodiments, all prize collection tasks are managed through a prize recall linked list set. When a user needs to perform a recall operation, the task identifiers in the prize recall linked list set can be used to display all the prize collection tasks of virtual prizes that can be recalled, improving the management efficiency of the recallable prize collection tasks. In addition, the time nodes of the prize recall tasks corresponding to the virtual prizes that cannot be recalled are deleted from the search prize recall linked list in the prize recall linked list set or marked as in a prohibited recall state, so that the task identifiers displayed on the prize recall page are all the identifiers of the prize collection tasks of virtual prizes that can be recalled, improving the effectiveness of the task identifier display.

[0161] In one embodiment, the target prize collection task may include a first prize collection subtask and a second prize collection subtask. Correspondingly, the task identifier includes a first subtask identifier and a second subtask identifier corresponding to the first prize collection subtask and the second prize collection subtask respectively; each subtask identifier corresponds to a prize recall linked list, so that the user can recall the virtual prize of a certain prize collection subtask in the target prize collection task. S208 may specifically include: when the first prize collection subtask is not completed within the target specified participation period, the server recalls the virtual prize matching the first prize collection subtask; when the second prize collection subtask is completed after the target specified participation period, the server stops recalling the virtual prize matching the second prize collection subtask. Therefore, for the target prize collection task, even if the virtual prizes of one or more prize collection subtasks are collected within the target specified participation period, the virtual prizes of other prize collection subtasks in the target prize collection task can be recalled after exceeding the target specified participation period.

[0162] Among them, the first prize collection subtask and the second prize collection subtask may respectively be subtasks in the target prize collection task that can be used to collect virtual prizes. For example, for a game task, when the user is playing the game task, killing a monster in the game can receive a corresponding virtual prize, such as gold coins or equipment, and killing the monster is a subtask in the game task.

[0163] Correspondingly, the prize recall linked list may also include a first prize recall sub-linked list and a second prize recall sub-linked list, and each prize recall sub-linked list has an index node and a time node. Among them, the first prize recall sub-linked list corresponds to the first prize collection subtask, and the second prize recall sub-linked list corresponds to the second prize collection subtask.

[0164] For recalling the virtual prizes of the first prize collection subtask and the second prize collection subtask, reference may be made to S208 in the above embodiments.

[0165] In one embodiment, the prize recall linked list includes a second prize recall sub-linked list corresponding to the second prize collection subtask. The method may further include: when the second prize collection subtask becomes overdue within the target specified participation period, the server deletes the target time node from the second prize recall sub-linked list; or, in the second prize recall sub-linked list, marks the target time node as a prohibited recall status.

[0166] For example, as Figure 9 shown, when the user sequentially kills the first monster and the second monster in the game task, the terminal will sequentially send a prize recall request carrying the monster identifier through the granularity control interface. When the server receives the prize recall request carrying the monster identifier 1 of the first monster, it searches for the matching prize recall linked list based on the monster identifier 1. Obtain the target time node in the prize recall linked list, and the corresponding period 1-3 of the target time node is the historical period when the first monster was not killed; then recall the virtual prize of the first monster, and mark the time node corresponding to the period 1-3 as gray (i.e., the prohibited recall status). Similarly, the virtual prize of the second monster can be recalled, and the time node corresponding to the period 2-3 is marked as gray. Therefore, for a certain game task, even if the virtual prize of a certain monster is killed and collected within the target specified participation period, the virtual prizes of other monsters in the game task can be recalled after exceeding the target specified participation period.

[0167] In the above embodiment, by dividing the prize collection task into multiple prize collection subtasks, even if the virtual prize of one or more prize collection subtasks is collected within the target specified participation period, the virtual prizes of other prize collection subtasks in the target prize collection task can be recalled after exceeding the target specified participation period, improving the flexibility of virtual prize recall and the recall rate of virtual prizes. In addition, the time nodes of the prize recall subtasks corresponding to the recalled virtual prizes are deleted from the searched prize recall linked list or marked as the prohibited recall status, so that when recalling next time, it is possible to avoid recalling the virtual prizes of the completed prize collection subtasks, thus avoiding the problem of repeated collection of virtual prizes.

[0168] In one embodiment, as Figure 10 shown, a method for recalling virtual prizes is provided. Taking the terminal 102 in Figure 1 as an example for illustration, it includes the following steps:

[0169] S1002, display the task identifiers of the uncompleted prize collection tasks within the target specified participation period.

[0170] Among them, the task identifier may be the identifier of the target prize collection task, that is, the target prize collection task can be found through this task identifier. Specifically, the task identifier may be the task name of the target prize collection task or other characters, such as numbers, or letters, or a combination of numbers and letters.

[0171] The prize collection task may be a task in a virtual interaction scenario where a virtual prize can be collected. For example, the daily check-in task in a virtual interaction scenario, or a game task on a specified date. When the user checks in on the same day, the user can obtain the virtual prize of the check-in task; and when the user completes the game task within the specified date, the user can obtain the virtual prize of the game task. Correspondingly, the target prize collection task refers to the prize collection task from which the user currently wants to recall the virtual prize. The above virtual interaction scenario may be an application scenario where interactions occur between virtual characters controlled by different users, or between a virtual character controlled by a user and a virtual character controlled by a computer program, such as a battle game.

[0172] Such as Figure 11 As shown, on the prize recall page, the task identifiers of each recently participated prize collection task are displayed. The task identifier is the task name of the prize collection task, namely "First Task", "Second Task" and "Third Task" respectively.

[0173] S1004, at the display position corresponding to the task identifier, display the recall button and the prize identifier of the prize collection task.

[0174] Among them, the recall button includes a first type of recall button and a second type of recall button. Next, the first type of recall button and the second type of recall button will be described:

[0175] The first type of recall button may be able to recall all virtual prizes in the target prize collection tasks during each specified participation period. For example, Figure 11 the "Perfect Recall" button in. By clicking the "Perfect Recall" button of the "First Task", all virtual prizes in the "First Task" can be recalled.

[0176] The second type of recall button may be able to recall some virtual prizes in the target prize collection tasks during each specified participation period. For example, Figure 11 the "Ordinary Recall" button in. By clicking the "Ordinary Recall" button of the "First Task", some virtual prizes in the "First Task" can be recalled, such as 70% of the virtual prizes of the "Perfect Recall".

[0177] In one embodiment, S1004 may specifically include: The terminal determines the list where the task identifier is located, determines the display position of the task identifier in the list, and then displays a recall button for the prize collection task and a prize identifier in the list. In addition, the terminal may also display an icon of the recallable virtual prize, the number of recallable times, and a recall button on the prize recall page; and may also display the amount of virtual resources consumed when executing the recall of the virtual prize, such as the number of gold coins consumed; and may also display the value of the recallable virtual prize, for details, refer to Figure 11 . Thus, the user can determine whether to recall based on this value and the number of gold coins to be consumed.

[0178] Among them, the above-mentioned number of recallable times may refer to the number of tasks for recalling virtual prizes in tasks held during different specified participation time periods. For example, for the first task, assuming that the first task is held on Monday, Wednesday, and Friday, and the number of recallable times is 2, it means that the virtual prize in two of the tasks held on Monday, Wednesday, and Friday can be recalled, such as the virtual prize in the first tasks held on Wednesday and Friday can be recalled.

[0179] S1006, in response to a prize recall operation triggered on the recall button of the target prize collection task, displays the recall result of the virtual prize that matches the prize identifier.

[0180] Among them, the target prize collection task belongs to the above-mentioned prize collection task. The virtual prize is recalled at the target time node in the matching prize recall linked list based on the task identifier. The prize recall linked list is a linked list formed with the task identifier of the target prize collection task as the index node and each specified participation time period of the target prize collection task as the time node. By setting up the prize recall linked list, the management of all unfinished target prize collection tasks can be realized, and the virtual prizes of various types of prize collection tasks can be managed through this prize recall linked list, improving the flexibility of virtual prize recall.

[0181] In one embodiment, the terminal detects a prize recall operation triggered on the recall button of the target prize collection task. When the prize recall operation is detected, a prize recall request carrying the task identifier of the target prize collection task is generated, and then the prize recall request is sent to the server. After receiving the prize recall request, the server searches for a matching prize recall linked list based on the task identifier carried in the prize recall request, then obtains the target time node in the prize recall linked list, and then recalls the virtual prize that matches the target prize collection task during the target specified participation time period. Among them, the target specified participation time period corresponding to the target time node is the historical time period when the target prize collection task is not completed. For the recall steps of the virtual prize, for details, refer to S204 - S208 in the above embodiment.

[0182] In one embodiment, the recall button includes a first type of recall button and a second type of recall button; S1006 may specifically include: the terminal displays the recall results of all virtual prizes that match the prize identifier in response to a prize recall operation triggered on the first type of recall button for the target prize collection task; and displays the recall results of some virtual prizes that match the prize identifier in response to a prize recall operation triggered on the second type of recall button for the target prize collection task.

[0183] In the above embodiment, when it is necessary to recall virtual prizes, the task identifiers of each uncompleted prize collection task within the target specified participation period are displayed, and the recall button and the prize identifier of the prize collection task are displayed, so that the user can select in real time the virtual prizes of the target prize collection task for recall, thereby realizing the re - collection of missed virtual prizes and improving the collection rate of virtual prizes. In addition, a prize recall linked list constructed with the task identifier of the target prize collection task as the index node and each specified participation period of the target prize collection task as the time node can quickly find the target specified participation period corresponding to the target prize collection task that the user has not completed, and then recall the virtual prizes that match the target prize collection task within the target specified participation period, improving the recall efficiency of virtual prizes.

[0184] As an example, the present application also provides an application scenario of an online game, and this application scenario applies the above - mentioned method for recalling virtual prizes. Specifically, the application of the method for recalling virtual prizes in this application scenario is as follows:

[0185] (1) Parameter introduction

[0186] First, the parameters used in this application scenario are described as shown in Table 1:

[0187] Retrieval identifier (retrieve_id): Corresponding to the task identifier and sub - task identifier in the above - mentioned embodiment, it is used to represent an activity, or to represent the monster in the activity that can receive rewards. For example, when there are rewards corresponding to one or more monsters in the activity, the retrieval identifier can also be the identifier corresponding to the monster. Among them, the activity may include a sign - in task or a game activity of killing monsters.

[0188] Activity type (type): Used to represent different activities. For example, different activity types of activities include daily sign - in tasks and game activities of killing monsters, etc.;

[0189] Activity time (time): Refers to the period during which the activity can be participated in, indicating that the user can participate in the activity within this time. If the user does not participate in the activity within this time, it means that the user has missed the activity and needs to retrieve the corresponding rewards (i.e., retrieve virtual prizes) through the reward retrieval system;

[0190] Virtual reward: It represents the rewards after the user performs the retrieval operation, such as equipment, currency, experience, etc.;

[0191] Cost: It represents the consumption required for the retrieval operation, such as consuming 1000 gold coins, or 2 diamonds, or 1 retrieval voucher.

[0192] Maximum retrieval times (count): It represents the maximum number of times the user can retrieve the rewards;

[0193] Effective time: It represents the effective specified time for retrieving the rewards of a certain activity. Within this time, the retrieval operation can be performed to obtain the corresponding rewards, and beyond this time, the retrieval operation cannot be performed. This effective time can be set according to the actual situation. For example, during holidays, in order to increase the number of game online users, the effective time can be configured during holidays so that users can perform the retrieval operation during holidays to attract users to go online and improve user enthusiasm.

[0194] Table 1

[0195] Retrieve identifier retrieve_id Used to represent an activity, or the monsters from which rewards can be obtained in that activity Activity type type Represents different activities Activity time time Indicates that the user can participate in the activity during this time Virtual prize reward Represents the reward after the user performs the retrieve operation Consumption cost Indicates the consumption required when performing the retrieve operation Maximum number of retrieves count Indicates the maximum number of times the user can retrieve the reward Valid time effective_time Indicates the effective specified time for retrieving the reward for a certain activity

[0196] (2) Application of the recall method in this application scenario

[0197] As Figure 12 shown, when the user completes the activity during the current activity time, or kills the monsters in the activity, or when the user does not participate in the activity during the activity time and clicks the retrieval button of the activity after the activity ends, a prize collection request carrying retrieve_id will be sent through the granularity control interface. After receiving the prize collection request, the reward retrieval system can perform corresponding operations on the nodes in the reward retrieval linked list. Among them, this activity is a game activity where virtual prizes can be collected. For example, by completing this activity or killing a certain monster in this activity, the corresponding virtual prizes can be collected. Next, the processes of the user participating in the activity, or killing the monsters in the activity, the user clicking the retrieval button of the activity, and the reward retrieval system performing operations on the nodes in the reward retrieval linked list will be elaborated as follows:

[0198] When the user completes the activity during the activity time, a prize redemption request carrying the retrieve_id of the entire activity is sent through the granularity control interface. Then, the reward retrieval system marks all virtual prizes in the activity as non-retrievable, that is, marks all time nodes in the prize retrieval linked list of the activity as non-retrievable. Thus, when the user retrieves the prize, it can effectively avoid retrieving the virtual prizes of the activities that the user has completed, and avoid the problem of the user repeatedly redeeming the prizes for the same activity at the same activity time. In addition, only the granularity control interface needs to be called throughout the process, without the need to develop additional logic to record the user's participation, which improves the development speed.

[0199] When the user participates in the activity during the activity time and kills the first monster in it (assuming there is a corresponding reward for killing the first monster), a prize redemption request carrying the retrieve_id of the first monster is sent through the granularity control interface. Then, the reward retrieval system marks the corresponding part of the virtual prizes in the activity as non-retrievable, that is, marks the time nodes in the prize retrieval linked list of the first monster in the activity as non-retrievable. For killing a certain monster in the activity, by setting the time nodes in the prize retrieval linked list of the monster as non-retrievable, when the user performs the retrieval operation, it can avoid retrieving the virtual prizes corresponding to the monsters that have been killed and avoid obtaining the virtual prizes of the monster repeatedly.

[0200] As Figure 12 shown, when the user clicks the retrieval button for each activity (such as Figure 11 the first task, the second task, or the third task in Figure 11 ) to retrieve the prize, on the one hand, the reward retrieval system will retrieve the virtual prizes of the activity; on the other hand, in the prize retrieval linked list of the activity, it will mark the time nodes corresponding to the retrieved virtual prizes as non-retrievable. Thus, when the user performs the retrieval operation, it can avoid retrieving the virtual prizes of the activities that have already been retrieved repeatedly, and thus avoid obtaining the virtual prizes of the activity repeatedly. Among them, when using "perfect retrieval", retrieval coupons can be consumed to retrieve virtual prizes, and in addition, gold coins can also be used; for "ordinary retrieval", relatively less gold coins than "perfect retrieval" can be consumed to retrieve virtual prizes. In addition, when using "ordinary retrieval" and "perfect retrieval", the corresponding retrievable times (that is, the above-mentioned maximum retrieval times) can also be specified. For example, for the "first task", "second task", and "third task", the retrievable times can be 2 times, as

[0201] It should be noted that when there are rewards for killing monsters in a certain activity, killing the monsters in this activity can be abstracted into different retrieval sub-tasks. That is, different monsters in an activity correspond to different retrieve_ids, and a reward retrieval linked list is equipped for each monster-killing task. When there is a reward only when the entire activity is completed, the entire activity corresponds to one retrieve_id, and a reward retrieval linked list is equipped for this entire activity. Through the above method, virtual prizes can be retrieved for different granularities, such as retrieving virtual prizes for the entire activity, or retrieving virtual prizes corresponding to certain or multiple monsters in an activity, improving the flexibility of retrieval.

[0202] It should be understood that although Figure 2 、 6 、each step in the flowcharts of 10 is shown in sequence according to the indication of the arrow, these steps do not necessarily execute in the order indicated by the arrow. Unless there is a clear description in this article, the execution of these steps has no strict order limit, and these steps can be executed in other orders. Moreover, Figure 2 、 6 、at least a part of the steps in 10 may include multiple steps or multiple stages. These steps or stages do not necessarily execute and complete at the same moment, but can execute at different moments. The execution order of these steps or stages is not necessarily sequential either, but can execute alternately or in turn with at least a part of other steps or steps or stages in other steps.

[0203] In one embodiment, as Figure 13 shown, a virtual prize recall device is provided. This device can adopt a software module or a hardware module, or a combination of both to become a part of a computer device. Specifically, this device includes: a receiving module 1302, a searching module 1304, an obtaining module 1306, and a recall module 1308, where:

[0204] The receiving module 1302 is used to receive a prize recall request carrying a task identifier;

[0205] The searching module 1304 is used to search for a matching prize recall linked list based on the task identifier; the prize recall linked list is a linked list formed with the task identifier of the target prize receiving task as the index node and each specified participation period of the target prize receiving task as the time node;

[0206] The obtaining module 1306 is used to obtain a target time node in the prize recall linked list; the target specified participation period corresponding to the target time node is the historical period when the target prize receiving task was not completed;

[0207] A recall module 1308, configured to recall virtual prizes that match a target prize collection task within a target specified participation period.

[0208] In the above embodiments, by setting up a prize recall linked list, it is possible to manage all uncompleted target prize collection tasks. Virtual prizes for various types of prize collection tasks can be managed through this prize recall linked list, improving the flexibility of virtual prize recall. When receiving a prize recall request, based on the task identifier in the prize recall request, find the matching prize recall linked list, then obtain the time node corresponding to the target specified participation period of the uncompleted target prize collection task in this prize recall linked list, and then recall the virtual prize that matches the target prize collection task within this historical period, thereby realizing the re - collection of missed virtual prizes and improving the collection rate of virtual prizes. In addition, a prize recall linked list constructed with the task identifier of the target prize collection task as the index node and the specified participation periods of the target prize collection task as time nodes can quickly find the target specified participation period corresponding to the uncompleted target prize collection task of the user, and then recall the virtual prize that matches the target prize collection task within this target specified participation period, improving the recall efficiency of virtual prizes.

[0209] In one of the embodiments, as Figure 14 shown, the device further includes:

[0210] A receiving module 1302, further configured to receive a prize collection request carrying a task identifier and a task completion time sent by a terminal;

[0211] A searching module 1304, further configured to, in response to the prize collection request, find the matching prize recall linked list according to the task identifier, and find the time node that matches the task completion time in the prize recall linked list;

[0212] A first processing module 1310, configured to delete the matching time node from the prize recall linked list; or, in the prize recall linked list, mark the matching time node as a prohibited recall state.

[0213] In the above embodiments, the time node corresponding to the prize recall task that has been completed in the current specified participation period can be deleted or marked as a prohibited recall state, so that when performing a recall, it is possible to avoid recalling the virtual prizes of the completed prize collection tasks, thereby avoiding the problem of duplicate collection of virtual prizes.

[0214] In one of the embodiments, as Figure 14 shown, the device further includes:

[0215] A receiving module 1302, further configured to receive a prize recall system login request sent by a terminal;

[0216] The search module 1304 is further configured to search for a prize recall linked list set according to the user identifier in the prize recall system login request;

[0217] The first sending module 1312 is configured to send the task identifiers of each prize collection task in the prize recall linked list set to the terminal, so that the terminal displays the task identifiers of each prize collection task on the prize recall page of the prize recall system.

[0218] In one embodiment, the prize recall page includes a recall button for each prize collection task; the target prize collection task belongs to the prize collection tasks; the prize recall request is a request generated by the terminal in response to triggering the recall button of the target prize collection task.

[0219] In the above embodiment, all prize collection tasks are managed through the prize recall linked list set. When a user needs to perform a recall operation, the task identifiers in the prize recall linked list set can be used to display all the prize collection tasks of the recallable virtual prizes, improving the management efficiency of the recallable prize collection tasks. In addition, the time nodes of the prize recall tasks corresponding to the non-recallable virtual prizes are deleted from the search prize recall linked list within the prize recall linked list set, or marked as a prohibited recall state, so that the task identifiers displayed on the prize recall page are all the identifiers of the prize collection tasks of the recallable virtual prizes, improving the effectiveness of the task identifier display.

[0220] In one embodiment, the recall button includes a first type recall button and a second type recall button; as Figure 14 shown, the apparatus further includes:

[0221] The deduction module 1314 is configured to deduct a first amount of virtual resources from the user account corresponding to the terminal when the prize recall request is a request generated by triggering the first type recall button; and deduct a second amount of virtual resources from the user account corresponding to the terminal when the prize recall request is a request generated by triggering the second type recall button;

[0222] wherein, the first amount is greater than the second amount; the quantity and value of the virtual prizes recalled based on the first type recall button are respectively greater than the quantity and value of the virtual prizes recalled based on the first type recall button.

[0223] In one embodiment, as Figure 14 shown, the apparatus further includes:

[0224] The second processing module 1316 is configured to delete the target time node from the prize recall linked list; or mark the target time node as a prohibited recall state in the prize recall linked list.

[0225] In one embodiment, the prize recall request is a request generated by the terminal in response to triggering a recall button for a target prize collection task; the obtaining module 1306 is further configured to obtain the reception time or generation time of the prize recall request; and obtain the valid time corresponding to the target prize collection task within the target specified participation period.

[0226] The recall module 1308 is further configured to, when the reception time or generation time is within the range of the valid time, recall the virtual prize that matches the target prize collection task within the target specified participation period.

[0227] In one embodiment, the target prize collection task includes a first prize collection subtask and a second prize collection subtask.

[0228] The recall module 1308 is further configured to, when the first prize collection subtask is not completed within the target specified participation period, recall the virtual prize that matches the first prize collection subtask; and when the second prize collection subtask is completed beyond the target specified participation period, stop recalling the virtual prize that matches the second prize collection subtask.

[0229] In one embodiment, the prize recall linked list includes a second prize recall sub-linked list corresponding to the second prize collection subtask; as Figure 14 shown, the apparatus further includes:

[0230] The third processing module 1318 is configured to, when the second prize collection subtask is completed beyond the target specified participation period, delete the target time node from the second prize recall sub-linked list; or, in the second prize recall sub-linked list, mark the target time node as a prohibited recall state.

[0231] In one embodiment, as Figure 14 shown, the apparatus further includes:

[0232] The generation module 1320 is configured to generate a target prize collection task within the target specified participation period according to the target time node.

[0233] The second sending module 1322 is configured to send the target prize collection task to the terminal to display the target prize collection task on the task operation page of the terminal.

[0234] The recall module 1308 is further configured to, when receiving a completion instruction for the target prize collection task returned by the terminal, recall the virtual prize that matches the target prize collection task within the target specified participation period.

[0235] In the above embodiments, by dividing the prize collection task into multiple prize collection subtasks, even if virtual prizes of one or more prize collection subtasks are collected within the target specified participation period, virtual prizes of other prize collection subtasks in the target prize collection task can be recalled after exceeding the target specified participation period, improving the flexibility of virtual prize recall and the recall rate of virtual prizes. In addition, the time nodes of the prize recall subtasks corresponding to the recalled virtual prizes are deleted from the searched prize recall linked list or marked as in a prohibited recall state, so that when recalling next time, it is possible to avoid recalling virtual prizes of completed prize collection subtasks, thus avoiding the problem of duplicate collection of virtual prizes.

[0236] In one embodiment, as Figure 15 shown, a virtual prize recall device is provided. This device can be a software module, a hardware module, or a combination of both to form part of a computer device. Specifically, the device includes: a display module 1502, a first display module 1504, and a second display module 1506, where:

[0237] The display module 1502 is used to display the task identifiers of each uncompleted prize collection task within the target specified participation period;

[0238] The first display module 1504 is used to display a recall button for the prize collection task and a prize identifier at the display position corresponding to the task identifier;

[0239] The second display module 1506 is used to display the recall result of the virtual prize matching the prize identifier in response to a prize recall operation triggered on the recall button of the target prize collection task;

[0240] Among them, the target prize collection task belongs to the prize collection task; the virtual prize is recalled based on the target time node in the searched prize recall linked list that matches the task identifier; the prize recall linked list is a linked list formed with the task identifier of the target prize collection task as the index node and each specified participation period of the target prize collection task as the time node.

[0241] In one of the embodiments, the recall button includes a first type of recall button and a second type of recall button;

[0242] The second display module 1506 is further used to display the recall result of all virtual prizes matching the prize identifier in response to a prize recall operation triggered on the first type of recall button of the target prize collection task; and display the recall result of some virtual prizes matching the prize identifier in response to a prize recall operation triggered on the second type of recall button of the target prize collection task.

[0243] In the above embodiments, by setting up a prize recall linked list, it is possible to manage all uncompleted target prize collection tasks. The virtual prizes of various types of prize collection tasks can be managed through this prize recall linked list, which improves the flexibility of virtual prize recall. When it is necessary to recall virtual prizes, the task identifiers of each uncompleted prize collection task within the target specified participation period are displayed, and the recall button and prize identifier of this prize collection task are shown. Thus, users can select in real time the virtual prizes of the target prize collection task for recall, thereby realizing the re-collection of missed virtual prizes and improving the collection rate of virtual prizes. In addition, the prize recall linked list constructed with the task identifier of the target prize collection task as the index node and each specified participation period of the target prize collection task as the time node can quickly find the target specified participation period corresponding to the uncompleted target prize collection task of the user, and then recall the virtual prizes matching the target prize collection task within this target specified participation period, which improves the recall efficiency of virtual prizes.

[0244] For the specific limitations of the virtual prize recall device, reference can be made to the limitations of the virtual prize recall method in the above text, which will not be elaborated here. Each module in the above virtual prize recall device can be implemented in whole or in part through software, hardware, and their combinations. The above modules can be embedded in the processor of the computer device in hardware form or be independent of it, or can be stored in the memory of the computer device in software form so that the processor can call and execute the operations corresponding to the above respective modules.

[0245] In one embodiment, a computer device is provided. This computer device can be a server, and its internal structure diagram can be as Figure 16 shown. This computer device includes a processor, a memory, and a network interface connected through a system bus. Among them, the processor of this computer device is used to provide computing and control capabilities. The memory of this computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program, and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The database of this computer device is used to store the prize recall linked list. The network interface of this computer device is used to communicate with external terminals through a network connection. When the computer program is executed by the processor, it realizes a virtual prize recall method.

[0246] In one embodiment, a computer device is provided. This computer device can be a terminal, and its internal structure diagram can be as Figure 17As shown in the figure. The computer device includes a processor, a memory, a communication interface, a display screen, and an input device connected through a system bus. Among them, the processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and computer programs. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage medium. The communication interface of the computer device is used to communicate with an external terminal in a wired or wireless manner, and the wireless manner can be implemented through WIFI, a carrier network, NFC (Near Field Communication), or other technologies. When the computer program is executed by the processor, it realizes a method for recalling virtual prizes. The display screen of the computer device can be a liquid crystal display screen or an electronic ink display screen, and the input device of the computer device can be a touch layer covering the display screen, or a button, a trackball, or a touchpad provided on the casing of the computer device, or an external keyboard, touchpad, or mouse, etc.

[0247] Those skilled in the art can understand that Figure 16 , 17 the structure shown in the figure is only a block diagram of some structures related to the solution of this application, and does not constitute a limitation on the computer device to which the solution of this application is applied. The specific computer device may include more or fewer components than those shown in the figure, or combine some components, or have different component arrangements.

[0248] In one embodiment, a computer device is further provided, including a memory and a processor. A computer program is stored in the memory, and when the processor executes the computer program, it realizes the steps in the above method embodiments.

[0249] In one embodiment, a computer-readable storage medium is provided, storing a computer program, and when the computer program is executed by the processor, it realizes the steps in the above method embodiments.

[0250] In one embodiment, a computer program product or a computer program is provided. The computer program product or the computer program includes computer instructions, and the computer instructions are stored in a computer-readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes the steps in the above method embodiments.

[0251] Those of ordinary skill in the art can understand that all or part of the processes in the methods of the above embodiments can be completed by instructing relevant hardware through a computer program. The computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above methods. Among them, any reference to a memory, storage, database, or other medium used in the various embodiments provided in the present application can include at least one of non-volatile and volatile memories. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, or optical memory, etc. Volatile memory can include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM can be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM), etc.

[0252] The technical features of the above embodiments can be combined arbitrarily. For the sake of brevity of description, not all possible combinations of the various technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, it should be considered as the scope recorded in this specification.

[0253] The above-described embodiments merely represent several implementation manners of the present application. Their descriptions are relatively specific and detailed, but they should not be construed as limiting the scope of the invention patent. It should be noted that for those of ordinary skill in the art, without departing from the concept of the present application, several modifications and improvements can still be made, and these all belong to the protection scope of the present application. Therefore, the protection scope of the patent of the present application should be subject to the appended claims.

Claims

1. A method for recalling virtual prizes, characterized in that, The method includes: Receiving a prize collection request carried by a terminal, which includes a task identifier and a task completion time; In response to the prize collection request, looking up a matching prize recall linked list according to the task identifier, and looking up a time node in the prize recall linked list that matches the task completion time; Deleting the matching time node from the prize recall linked list; or, in the prize recall linked list, marking the matching time node as a prohibited recall state; Receiving a prize recall request carried by a task identifier; the task identifier is the task identifier of at least one target prize collection task that has not been participated in; In the prize recall linked list set, looking up a matching prize recall linked list based on the task identifier; the prize recall linked list set is obtained by connecting the index nodes in the prize recall linked lists corresponding to each prize collection task; the prize recall linked list is a linked list formed by using the task identifier of the target prize collection task as the index node and using each specified participation period of the target prize collection task as the time node; the state indicating whether recall is possible marked by the time node changes according to the collection situation and the valid time; Obtaining a target time node in the prize recall linked list; the target specified participation period corresponding to the target time node is a historical period when the target prize collection task has not been completed; Recalling virtual prizes that match the target prize collection task within the target specified participation period.

2. The method according to claim 1, wherein, The method is applied to a prize recall system; Before receiving the prize recall request carried by a task identifier, the method further includes: Receiving a prize recall system login request sent by a terminal; Looking up the prize recall linked list set according to the user identifier in the prize recall system login request; Sending the task identifiers of each prize collection task in the prize recall linked list set to the terminal, so that the terminal displays the task identifiers of each prize collection task on the prize recall page of the prize recall system.

3. The method according to claim 2, characterized in that, The prize recall page includes a recall button for each prize collection task; the target prize collection task belongs to the prize collection tasks; the prize recall request is a request generated by the terminal in response to triggering the recall button for the target prize collection task.

4. The method according to claim 3, wherein The recall button includes a first type of recall button and a second type of recall button; the method further includes: When the prize recall request is a request generated by triggering the first type of recall button, deducting a first amount of virtual resources from the user account corresponding to the terminal; When the prize recall request is a request generated by triggering the second type of recall button, deducting a second amount of virtual resources from the user account corresponding to the terminal; Wherein, the first amount is greater than the second amount; the quantity and value of the virtual prizes recalled based on the first type of recall button are respectively greater than the quantity and value of the virtual prizes recalled based on the first type of recall button.

5. The method according to claim 1, wherein After recalling the virtual prizes that match the target prize collection task within the target specified participation period, the method further includes: Delete the target time node from the prize recall linked list; or, In the prize recall linked list, mark the target time node as a state where recall is prohibited.

6. The method according to claim 1, characterized in that, The prize recall request is a request generated by the terminal in response to triggering a recall button for the target prize collection task; the method further includes: Obtain the reception time or generation time of the prize recall request; Obtain the valid time corresponding to the target prize collection task within the target specified participation period; When the reception time or the generation time is within the range of the valid time, perform the step of recalling the virtual prize that matches the target prize collection task within the target specified participation period.

7. The method according to any one of claims 1 to 6, characterized in that The target prize collection task includes a first prize collection subtask and a second prize collection subtask; recalling the virtual prize that matches the target prize collection task within the target specified participation period includes: When the first prize collection subtask is not completed within the target specified participation period, recall the virtual prize that matches the first prize collection subtask; When the second prize collection subtask is completed past the target specified participation period, stop recalling the virtual prize that matches the second prize collection subtask.

8. The method according to any one of claims 1 to 6, characterized in that, The method further includes: Generate the target prize collection task within the target specified participation period according to the target time node; Send the target prize collection task to the terminal to display the target prize collection task on the task operation page of the terminal; Recalling the virtual prize that matches the target prize collection task within the target specified participation period includes: When receiving a completion instruction for the target prize collection task returned by the terminal, recall the virtual prize that matches the target prize collection task within the target specified participation period.

9. The method according to claim 7, wherein The prize recall linked list includes a second prize recall sub-linked list corresponding to the second prize collection subtask; the method further includes: When the second prize collection subtask is completed past the target specified participation period, delete the target time node from the second prize recall sub-linked list; or, In the second prize recall sub-linked list, mark the target time node as a state where recall is prohibited.

10. A method for recalling virtual prizes, characterized in that, The method includes: Display the task identifiers of the uncompleted prize collection tasks within the target specified participation period; At the display position corresponding to the task identifier, display the recall button and the prize identifier of the prize collection task; In response to a prize recall operation triggered on the recall button of the target prize collection task, display the recall result of the virtual prize that matches the prize identifier. Among them, the target prize redemption task belongs to the prize redemption task; the virtual prize is recalled at the target time node in the prize recall linked list that matches the task identifier in the prize recall linked list set; the prize recall linked list set is obtained by connecting the index nodes in the prize recall linked lists corresponding to each prize redemption task; the prize recall linked list is a linked list formed with the task identifier of the target prize redemption task as the index node and each specified participation period of the target prize redemption task as the time node; the state indicating whether recall is possible marked by the time node changes with the redemption situation and the valid time. The method further includes: sending a prize redemption request carrying the task identifier and the task completion time to the server, so that the server searches for the matching prize recall linked list according to the task identifier and searches for the time node that matches the task completion time in the prize recall linked list; deleting the matching time node from the prize recall linked list; or, in the prize recall linked list, marking the matching time node as a prohibited recall state.

11. The method according to claim 10, wherein The recall button includes a first type of recall button and a second type of recall button. The displaying the recall result of the virtual prize that matches the prize identifier in response to the prize recall operation triggered on the recall button of the target prize redemption task includes: responding to the prize recall operation triggered on the first type of recall button of the target prize redemption task, and displaying the recall results of all virtual prizes that match the prize identifier; responding to the prize recall operation triggered on the second type of recall button of the target prize redemption task, and displaying the recall results of some virtual prizes that match the prize identifier.

12. A recall device for virtual prizes, characterized in that, The device includes: a receiving module, configured to receive a prize redemption request carrying the task identifier and the task completion time sent by the terminal; a searching module, configured to, in response to the prize redemption request, search for the matching prize recall linked list according to the task identifier and search for the time node that matches the task completion time in the prize recall linked list; a first processing module, configured to delete the matching time node from the prize recall linked list; or, in the prize recall linked list, mark the matching time node as a prohibited recall state; The receiving module is further configured to receive a prize recall request carrying the task identifier; the task identifier is the task identifier of at least one target prize redemption task that has not been participated in; The searching module is further configured to search for the matching prize recall linked list in the prize recall linked list set based on the task identifier; the prize recall linked list set is obtained by connecting the index nodes in the prize recall linked lists corresponding to each prize redemption task; the prize recall linked list is a linked list formed with the task identifier of the target prize redemption task as the index node and each specified participation period of the target prize redemption task as the time node; the state indicating whether recall is possible marked by the time node changes with the redemption situation and the valid time. An acquisition module, configured to acquire a target time node in the prize recall linked list; a target specified participation period corresponding to the target time node is a historical period in which the target prize collection task has not been completed; A recall module, configured to recall virtual prizes matching the target prize collection task within the target specified participation period.

13. The device according to claim 12, characterized in that, The device further includes: The receiving module is further configured to receive a prize recall system login request sent by a terminal; The searching module is further configured to search for a prize recall linked list set according to the user identifier in the prize recall system login request; A first sending module, configured to send task identifiers of each prize collection task in the prize recall linked list set to the terminal, so that the terminal displays the task identifiers of each prize collection task on the prize recall page of the prize recall system.

14. The device according to claim 13, characterized in that, The prize recall page includes a recall button for each prize collection task; the target prize collection task belongs to the prize collection tasks; the prize recall request is a request generated by the terminal in response to triggering the recall button for the target prize collection task.

15. The device according to claim 14, characterized in that, The recall button includes a first type of recall button and a second type of recall button; the device further includes: A deduction module, configured to, when the prize recall request is a request generated by triggering the first type of recall button, deduct a first amount of virtual resources from the user account corresponding to the terminal; when the prize recall request is a request generated by triggering the second type of recall button, deduct a second amount of virtual resources from the user account corresponding to the terminal; wherein, the first amount is greater than the second amount; the quantity and value of the virtual prizes recalled based on the first type of recall button are respectively greater than the quantity and value of the virtual prizes recalled based on the first type of recall button.

16. The device according to claim 12, characterized in that, After recalling the virtual prizes matching the target prize collection task within the target specified participation period, the device further includes: A second processing module, configured to delete the target time node from the prize recall linked list; or, mark the target time node as a prohibited recall state in the prize recall linked list.

17. The device according to claim 12, characterized in that, The prize recall request is a request generated by the terminal in response to triggering the recall button for the target prize collection task; the device further includes: The acquisition module is further configured to acquire the reception time or generation time of the prize recall request; acquire the valid time corresponding to the target prize collection task within the target specified participation period; The recall module is further configured to, when the reception time or the generation time is within the range of the valid time, recall the virtual prizes matching the target prize collection task within the target specified participation period.

18. The device according to any one of claims 12 to 17, characterized in that, The target prize collection task includes a first prize collection subtask and a second prize collection subtask; The recall module is further configured to recall a virtual prize that matches the first prize collection subtask when the first prize collection subtask is not completed within the target specified participation period; and stop recalling the virtual prize that matches the second prize collection subtask when the second prize collection subtask is completed beyond the target specified participation period.

19. The device according to any one of claims 12 to 17, characterized in that The device further includes: A generation module, configured to generate a target prize collection task within the target specified participation period according to the target time node; A second sending module, configured to send the target prize collection task to the terminal, so that the target prize collection task is displayed on the task operation page of the terminal; The recall module is further configured to recall a virtual prize that matches the target prize collection task within the target specified participation period when receiving a completion instruction for the target prize collection task returned by the terminal.

20. The device according to claim 18, characterized in that, The prize recall linked list includes a second prize recall sub-linked list corresponding to the second prize collection subtask; the device further includes: A third processing module, configured to delete the target time node from the second prize recall sub-linked list when the second prize collection subtask is completed beyond the target specified participation period; or mark the target time node as a prohibited recall state in the second prize recall sub-linked list.

21. A recall device for virtual prizes, characterized in that, The device includes: A display module, configured to display the task identifiers of the prize collection tasks that are not completed within the target specified participation period; A first display module, configured to display a recall button and a prize identifier of the prize collection task at a display position corresponding to the task identifier; A second display module, configured to display a recall result of the virtual prize that matches the prize identifier in response to a prize recall operation triggered on the recall button of the target prize collection task; Wherein, the target prize collection task belongs to the prize collection task; the virtual prize is recalled from a target time node in a prize recall linked list that is found to match based on the task identifier in a set of prize recall linked lists; the set of prize recall linked lists is obtained by connecting index nodes in the prize recall linked lists corresponding to each prize collection task; the prize recall linked list is a linked list formed with the task identifier of the target prize collection task as the index node and each specified participation period of the target prize collection task as the time node; the state indicating whether recall is possible marked by the time node changes according to the collection situation and the valid time; A sending module, configured to send a prize collection request carrying the task identifier and the task completion time to the server, so that the server searches for a matching prize recall linked list according to the task identifier and searches for a time node that matches the task completion time in the prize recall linked list; delete the matching time node from the prize recall linked list; or mark the matching time node as a prohibited recall state in the prize recall linked list.

22. The device according to claim 21, wherein The recall button includes a first type recall button and a second type recall button; The second display module is further configured to, in response to a prize recall operation triggered on the first type of recall button of the target prize collection task, display the recall results of all virtual prizes matching the prize identifier; and in response to a prize recall operation triggered on the second type of recall button of the target prize collection task, display the recall results of some virtual prizes matching the prize identifier.

23. A computer device, comprising a memory and a processor, the memory storing a computer program, characterized in that, When the processor executes the computer program, the steps of the method according to any one of claims 1 to 11 are implemented.

24. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by the processor, the steps of the method according to any one of claims 1 to 11 are implemented.

25. A computer program product, comprising a computer program, characterized in that, When the computer program is executed by the processor, the steps of the method according to any one of claims 1 to 11 are implemented.

Images