CN115645932A

CN115645932A - Ranking list processing method and device, storage medium and electronic equipment

Info

Publication number: CN115645932A
Application number: CN202211314176.5A
Authority: CN
Inventors: 王毅; 黄文杰; 张丰翼; 石铭林
Original assignee: Guangzhou Boguan Information Technology Co Ltd
Current assignee: Guangzhou Boguan Information Technology Co Ltd
Priority date: 2022-10-25
Filing date: 2022-10-25
Publication date: 2023-01-31

Abstract

The disclosure provides a ranking list processing method and device, a storage medium and electronic equipment, and relates to the technical field of computers, wherein the ranking list processing method comprises the following steps: according to the credits of each game team in the current game progress, ranking each game team to obtain a ranking list of the game team; and splitting the ranking list of the game teams according to the elimination state of each game team in the current game process. According to the game ranking list splitting method and device, the game ranking list is split based on the elimination state of the game team, the readability of the ranking list is improved to a certain extent, the progress condition of the game can be visually reflected, and the predictability of the game result is improved.

Description

Ranking list processing method and device, storage medium and electronic equipment

Technical Field

The present disclosure relates to the field of computer technologies, and in particular, to a ranking list processing method, a ranking list processing apparatus, a computer-readable storage medium, and an electronic device.

Background

With the increasing popularity of the electric competition on each live broadcast platform, the requirements of people on the production of the electric competition are higher and higher. The game ranking list is displayed as an important ring in the electronic competition production process.

In the related art, game teams are generally ranked according to game scores to obtain a game ranking board until the game is finished. For some games, the game team with the highest score is the final winner of the game, the current game progress situation is difficult to be reflected visually by adopting the ranking list, and the predicted game result is poor in accuracy.

It is to be noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present disclosure, and thus may include information that does not constitute prior art known to those of ordinary skill in the art.

Disclosure of Invention

The invention provides a ranking list processing method, a ranking list processing device, a computer readable storage medium and an electronic device, which at least to a certain extent solve the problems that in the related art, the ranking list is difficult to intuitively display the progress condition of a game and the prediction accuracy of a game result is low.

Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the disclosure.

According to a first aspect of the disclosure, a ranking list processing method is provided, and the method includes: according to the credits of all game teams in the current game process, sequencing all game teams to obtain a ranking list of the game teams; and splitting the ranking list of the game teams according to the elimination state of each game team in the current game process.

In an exemplary embodiment of the present disclosure, the splitting the leaderboard of each game team according to a state of elimination of the game team in the current game process includes: and if the current game progress meets the preset conditions, splitting the ranking list of the game teams according to the elimination state of each game team in the current game progress.

In an exemplary embodiment of the present disclosure, the preset condition includes any one or more of: the number of eliminated game teams reaches a preset threshold value; the game duration exceeds a preset duration.

In an exemplary embodiment of the present disclosure, the splitting the leaderboard of each game team according to a state of elimination of the game team in the current game process includes: determining a first target elimination line according to the elimination state of each game line in the current game process; deleting a first target eliminating team in the ranking lists of the game teams to obtain a first ranking list; and ranking the first target eliminating team based on the integral of the first target eliminating team to construct a second ranking list.

In an exemplary embodiment of the present disclosure, the method further comprises: if the elimination state of one or more game teams changes, updating the first ranking list and the second ranking list based on the latest elimination state corresponding to the game teams with the changed elimination state.

In an exemplary embodiment of the disclosure, the updating the first ranking board and the second ranking board based on a latest elimination state corresponding to a game team of which elimination state changes includes: determining a second target elimination line from the game lines with the changed elimination states based on the latest elimination state corresponding to the game lines with the changed elimination states; deleting the second target culling team from the first leaderboard; inserting the second target eliminating team into the second leaderboard based on the score of the second target eliminating team.

In an exemplary embodiment of the present disclosure, the method further comprises: if the points of one or more game teams in the first ranking list change, updating the first ranking list based on the latest points corresponding to the game teams with the changed points.

In an exemplary embodiment of the present disclosure, the method further comprises: rendering the first leaderboard and the second leaderboard for display in a graphical user interface.

In an exemplary embodiment of the disclosure, the first and second leaderboards include any one or more of the following information: a game team rank order, a game team name, an identification of one or more game characters used by a game team, battle performance data of a game team, tallies of a game team.

In an exemplary embodiment of the disclosure, the rendering the first leaderboard and the second leaderboard includes: rendering the first ranking list based on a first preset configuration, and rendering the second ranking list based on a second preset configuration.

In an exemplary embodiment of the disclosure, the rendering the first leaderboard and the second leaderboard includes: rendering the identifiers of the game characters used by the game teams in the first ranking list based on the survival states corresponding to the game characters used by the game teams in the first ranking list.

According to a second aspect of the present disclosure, there is provided a leaderboard processing apparatus, the apparatus comprising: the first sequencing module is used for sequencing all game teams according to the scores of all the game teams in the current game process to obtain a game team ranking list; and the second ranking module is used for splitting the ranking list of the game teams according to the elimination state of each game team in the current game process.

According to a third aspect of the present disclosure, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the leader board processing method described above.

According to a fourth aspect of the present disclosure, there is provided an electronic device comprising: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to perform the leaderboard processing method via execution of the executable instructions.

The technical scheme of the disclosure has the following beneficial effects:

in the ranking list processing process, according to the scores of all game teams in the current game process, ranking all game teams to obtain a ranking list of the game teams; and splitting the ranking list of the game teams according to the elimination state of each game team in the current game process. In the process, the game ranking list is split according to the elimination state of each game team in the current game process, so that the ranking list can show the elimination state of each game team, the progress condition of the game can be visually reflected, the readability of the ranking list can be improved to a certain extent, and the predictability of the game result can be improved.

It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is apparent that the drawings in the following description are only some embodiments of the present disclosure, and that other drawings can be obtained from those drawings without inventive effort for a person skilled in the art.

Fig. 1 shows a flowchart of a leader board processing method in the present exemplary embodiment;

FIG. 2 illustrates a flow chart for splitting a leaderboard of a gaming team in an exemplary embodiment;

FIG. 3 illustrates a flow diagram for updating a first leaderboard and a second leaderboard in this exemplary embodiment;

FIG. 4 illustrates a flowchart of a leader board real-time update in the exemplary embodiment;

fig. 5 shows a block diagram of a structure of a ranking board processing apparatus in the present exemplary embodiment;

fig. 6 illustrates an electronic device for implementing the ranking board processing method in the exemplary embodiment.

Detailed Description

Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the embodiments of the present disclosure can be practiced without one or more of the specific details, or with other methods, components, devices, steps, etc. In other instances, well-known technical solutions have not been shown or described in detail to avoid obscuring aspects of the present disclosure.

The terms "a," "an," "the," and "said" are used in this specification to denote the presence of one or more elements/components/parts/etc.; the terms "comprising" and "having" are intended to be inclusive and mean that there may be additional elements/components/etc. other than the listed elements/components/etc.; the terms "first" and "second", etc. are used merely as labels, and are not limiting on the number of their objects.

Furthermore, the drawings are merely schematic illustrations of the present disclosure and are not necessarily drawn to scale. The same reference numerals in the drawings denote the same or similar parts, and thus their repetitive description will be omitted. Some of the block diagrams shown in the figures are functional entities and do not necessarily correspond to physically or logically separate entities. These functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor devices and/or microcontroller devices.

In the related art, the game ranking list is generally obtained by simply ranking the game ranks in descending order of the score of the game ranks, and it is difficult to extract information related to the progress of the game from the game ranking list. Further, for a game that is eliminated, a high score does not mean that it is not eliminated, and thus the accuracy of the game result predicted based on the leaderboard is low for that type of game.

In view of one or more of the above-described problems, exemplary embodiments of the present disclosure provide a ranking board processing method and a ranking board processing apparatus that are applicable to a game scene with a knockout system.

An exemplary embodiment of the present disclosure provides a leader board processing method, as shown in fig. 1, which specifically includes the following steps S110 to S120:

step S110, according to the credits of each game team in the current game progress, sequencing each game team to obtain a ranking list of the game teams;

and step S120, splitting the ranking list of the game teams according to the elimination state of each game team in the current game process.

In the ranking list processing process, the game ranking list is split according to the elimination state of each game team in the current game process, so that the ranking list can show the elimination state of each game team, the progress condition of the game can be visually reflected, the readability of the ranking list can be improved to a certain extent, and the predictability of the game result is facilitated to be improved.

Each step in fig. 1 will be described in detail below.

In step S110, the respective game teams are ranked according to the points of the respective game teams in the current game progress, and a ranking list of the game teams is obtained.

A plurality of game teams can exist for fighting under the current game progress, and each game team can have one or more game characters participating in the fighting, and the game characters can be controlled through the game terminal. The tally of the game team may be derived from the character tally of the game character participating in the play by the game team. For example, the player may be given a player's credit to the player character participating in the battle and a player's credit to the player team. The game team may be ranked in descending order of the game team's tallies to obtain a game team leader board.

The leaderboard of the gaming team may be displayed after the game is formally started. For example, after the game is started, the ranking of the game teams in the game team leader board may be continuously updated according to the change of the scores of the game teams. The initial ranking order of the game teams in the game team ranking list can be randomly ranked or ranked according to a set rule, and is not particularly limited. The points of the game team may change as the game behavior of the game characters in the game team occurs, and the initial ranking order of the game team leaderboards may be updated based on the change in the points of the respective game teams after the game is started in order.

If all the game characters participating in the battle in the game team are knocked out, the elimination state of the game team can be changed from non-elimination to elimination.

In an optional implementation manner, the splitting of the leaderboard of each game team according to the elimination state of each game team in the current game process can be implemented by the following steps: if the current game progress meets the preset conditions, the ranking list of the game teams can be split according to the elimination state of each game team in the current game progress.

The preset conditions include any one or more of the following: the number of eliminated game teams reaches a preset threshold value; the game duration exceeds a preset duration.

In the process of game playing, the elimination state of each game team can be detected in real time, and if the number of the eliminated game teams is detected to reach a preset threshold value, the ranking list of the game teams can be split.

In addition, the game time length of the current game process can be detected, and if the game time length of the current game process is detected to exceed the preset time length, the game ranking list can be split.

In the above steps, when the current game progress meets the preset condition, the game ranking list is split so as to present the game team who is still in progress at the end of the game, and the performance overhead caused by splitting the ranking list too early can be reduced while the tension and the intensity of the game are improved.

When the ranking lists of the game teams are disassembled, the eliminated ranking lists in the current game ranking list can be extracted to form two ranking lists. That is, a first ranking board is formed by game teams that are not currently eliminated, and a second ranking board is formed by game teams that are currently eliminated.

In an alternative embodiment, the splitting the leaderboard of the game team according to the elimination status of each game team in the current game process can be implemented by the steps shown in fig. 2, and specifically includes the following steps S210 to S230:

step S210, determining a first target eliminated team according to the eliminated state of each game team in the current game process;

step S220, deleting a first target eliminating team in the ranking lists of the game teams to obtain a first ranking list;

and step S230, ranking the first target eliminating team based on the integral of the first target eliminating team to construct a second ranking list.

The first target eliminated team may be a eliminated game team in the current game play. The first ranking list is a ranking list composed of game teams that are not currently eliminated, and the second ranking list is a ranking list composed of game teams that are currently eliminated.

It should be noted that the execution sequence of the steps S220 and S230 is not limited here, that is, the first ranking list may be constructed first, and then the second ranking list may be constructed; or the second ranking list can be constructed firstly, and then the first ranking list can be constructed; the first ranking list and the second ranking list can also be synchronously constructed.

In addition, according to the elimination state of each game team in the current game progress, the ranking list of the game teams is split, and the method can be realized through the following steps: determining game teams which are not eliminated currently according to elimination states of the game teams in the current game process; deleting the game queues which are not eliminated currently in the ranking lists of the game queues to form a second ranking list; and ranking the game teams which are not eliminated currently based on the points of the game teams which are not eliminated currently to obtain a first ranking list.

In the steps, the eliminated game teams and the game teams which are not eliminated are separated and ranked, so that the readability of the ranking list is enhanced, and the game teams in the turn can be more intuitively presented.

As the progress of the game progresses, the state of credit or elimination of the game team may change.

In an alternative embodiment, if there is a change in the elimination status of one or more game teams, the first and second leaders may be updated based on the latest elimination status corresponding to the game team whose elimination status has changed.

If the elimination state of one or more game teams changes, the first ranking list and the second ranking list can be updated in real time so as to present the game dynamics in time.

In an alternative embodiment, the updating the first ranking board and the second ranking board based on the latest elimination status corresponding to the game team with the changed elimination status may be implemented by the steps shown in fig. 3, and specifically includes the following steps S310 to S330:

step S310, determining a second target elimination team from the game teams with the changed elimination states based on the latest elimination states corresponding to the game teams with the changed elimination states;

step S320, deleting the second target eliminating team from the first ranking list;

step S330, inserting the second target eliminating team into the second ranking list based on the score of the second target eliminating team.

The second target eliminated team may be an eliminated game team among game teams whose elimination state changes, and the second target eliminated team may be deleted from the first ranking list and inserted into the second ranking list to update the ranking list so as to present the game dynamics in time.

It should be noted that the execution sequence of the steps S320 and S330 is not limited here, that is, the first ranking list may be updated first, and then the second ranking list may be updated; or the second ranking list can be updated first, and then the first ranking list is updated; the first ranking list and the second ranking list can also be updated synchronously.

In an alternative embodiment, if there is a change in the points of one or more teams of games in the first chart, the first chart may be updated based on the latest point corresponding to the team of games for which the point has changed.

When the first ranking list is updated based on the latest points corresponding to the game team whose points have changed, the latest points corresponding to the game team whose points have changed are compared with the points of the other game teams in the first ranking list, the position of the game team whose points have changed in the first ranking list is determined, and the first ranking list is updated.

Since the second ranking list is a ranking list composed of game teams that are currently eliminated, and the points of the game teams that are eliminated in the second ranking list are not always changed, when the point data is changed, only the point change of each game team in the first ranking list can be detected, so as to reduce unnecessary performance overhead.

In the steps, after the points of the game team change, the ranking list is updated in real time so as to present the game dynamics in time.

As shown in fig. 4, a flowchart of a leader board real-time update is provided, which specifically includes the following steps:

step S410, according to the scores of all game teams in the current game progress, all game teams are ranked to obtain a ranking list of the game teams;

step S420, if the current game progress meets the preset condition, dividing the ranking list of the game team into a first ranking list and a second ranking list according to the elimination state of each game team in the current game progress;

in step S430, if there is a change in the elimination state or the score of the game team in the first game ranking list or the second game ranking list, the first ranking list and the second ranking list are updated.

Before the current game progress meets the preset condition, if the credit of the game team changes in the ranking list of the game team, the ranking list of the game team can be updated in real time so as to ensure real-time updating of game dynamics.

The game team leader board may be rendered for display in the graphical user interface prior to splitting the game team leader board into the first leader board and the second leader board. For example, the ranking information of the ranking list of the game team may be sent to the rendering engine to render the ranking list of the game team and further displayed on the graphical user interface, and if the ranking order of the game team in the ranking list of the game team changes, the change information of the ranking list of the game team may be sent to the rendering engine so that the rendering engine updates the currently displayed ranking list of the game team based on the change information of the ranking list of the game team.

After splitting the leaderboard of the game team into the first leaderboard and the second leaderboard, in an alternative embodiment, the first leaderboard and the second leaderboard may be rendered for display in a graphical user interface. For example, the ranking information of the first ranking board and the second ranking board may be sent to the rendering engine, so that the rendering engine renders the first ranking board and the second ranking board, and displays the first ranking board and the second ranking board on the graphical user interface, and if the ranking order of the game teams in the first ranking board and/or the second ranking board changes due to changes in the elimination state of the game teams or changes in the scores of the game teams, the change information of the first ranking board and/or the second ranking board may be sent to the rendering engine, so that the rendering engine updates the currently displayed first ranking board and/or second ranking board based on the change information of the first ranking board and/or second ranking board.

In the above steps, the ranking list can be presented in the graphical user interface through rendering processing, and the ranking list is visualized so as to facilitate browsing of the user.

The first ranking board and the second ranking board may include any one or more of the following information: a game team rank order, a game team name, an identification of one or more game characters used by a game team, battle performance data of a game team, tallies of a game team. Various types of data are displayed in the ranking list, so that a user can accurately master the game dynamics.

In an optional implementation, rendering the first and second leaderboards may be implemented by: rendering the first ranking list based on the first preset configuration, and rendering the second ranking list based on the second preset configuration.

Illustratively, the first preset configuration is: the characters of each game team board in the first ranking list are white, and the bottom color is black; the second preset configuration is: the characters of each game team column in the second ranking list are light gray, and the bottom color is dark gray. It should be noted that, in the practical application process, the first preset configuration and the second preset configuration may specifically perform color redefinition according to the visual effect of the game itself, and are not specifically limited herein.

The first ranking list and the second ranking list are rendered through different preset configurations, so that a user can distinguish the first ranking list and the second ranking list better, and the ornamental value of the ranking lists is improved.

When the rendering is carried out, different game teams can be rendered into different colors, so that the difficulty of obtaining information from the ranking list by the user is reduced.

In an optional implementation, the rendering the first ranking board and the second ranking board may be further implemented by: and rendering the identifiers of the game characters used by the game teams in the first ranking list based on the survival states corresponding to the game characters used by the game teams in the first ranking list.

For example, if a game character is in a survival state, the character identifier of the game character in the corresponding ranking list can be subjected to color rendering; if the game role is in a death state, black and white rendering can be performed on the role identification of the game role in the corresponding ranking list.

In the process, the avatar identification of the game role in the game team is rendered based on the survival state, so that the user can more accurately master the game progress condition, and the predictability of the game is further improved.

Exemplary embodiments of the present disclosure also provide a ranking board processing apparatus, as shown in fig. 5, the ranking board processing apparatus 500 may include:

the first ranking module 510 is configured to rank the game teams according to the scores of the game teams in the current game process to obtain a ranking list of the game teams;

the second ranking module 520 is configured to split the ranking list of each game team according to the elimination status of each game team in the current game process.

In an alternative embodiment, the second sorting module 520 may be configured to: and if the current game progress meets the preset condition, splitting the ranking list of the game teams according to the elimination state of each game team in the current game progress.

In an alternative embodiment, the preset conditions include any one or more of the following: the number of eliminated game teams reaches a preset threshold value; the game duration exceeds a preset duration.

In an alternative embodiment, the second sorting module 520 may be configured to: determining a first target eliminated team according to the eliminated state of each game team in the current game process; deleting a first target eliminating team in the ranking lists of the game teams to obtain a first ranking list; and ranking the first target eliminating team based on the integral of the first target eliminating team to construct a second ranking list.

In an optional implementation, the second sorting module 520 further includes: and the first updating module is used for updating the first ranking list and the second ranking list based on the latest elimination state corresponding to the game teams with the changed elimination states if the elimination states of one or more game teams change.

In an alternative embodiment, the first update module may be configured to: determining a second target elimination line from the game lines with the changed elimination states based on the latest elimination state corresponding to the game line with the changed elimination state; deleting the second target eliminating team from the first ranking list; inserting the second target eliminating team into the second ranking list based on the score of the second target eliminating team.

In an optional implementation, the second sorting module 520 further includes: and the second updating module is used for updating the first ranking list based on the latest points corresponding to the game teams with the changed points if the points of one or more game teams are changed in the first ranking list.

In an optional implementation, the second sorting module 520 further includes: and the ranking list display module is used for rendering the first ranking list and the second ranking list so as to display the first ranking list and the second ranking list in the graphical user interface.

In an optional implementation, the first ranking board and the second ranking board include any one or more of the following information: a game team rank order, a game team name, an identification of one or more game characters used by a game team, battle performance data of a game team, tallies of a game team.

In an alternative embodiment, the leader board display module may be configured to: rendering the first ranking list based on the first preset configuration, and rendering the second ranking list based on the second preset configuration.

In an optional implementation, the leader board display module may be further configured to: and rendering the identifiers of the game characters used by the game teams in the first ranking list based on the survival states corresponding to the game characters used by the game teams in the first ranking list.

The specific details of each part in the ranking list processing apparatus 500 are described in detail in the method part embodiment, and details that are not disclosed may refer to the method part embodiment, and thus are not described again.

Exemplary embodiments of the present disclosure also provide a computer-readable storage medium having stored thereon a program product capable of implementing the ranking list processing method described above in this specification. In some possible embodiments, various aspects of the disclosure may also be implemented in the form of a program product comprising program code for causing an electronic device to perform the steps according to various exemplary embodiments of the disclosure as described in the above-mentioned "exemplary methods" section of this specification, when the program product is run on the electronic device.

In particular, the program product stored on the computer-readable storage medium may cause the electronic device to perform the steps of:

according to the credits of all game teams in the current game process, all game teams are ranked to obtain a ranking list of the game teams;

and splitting the ranking list of the game teams according to the elimination state of each game team in the current game process.

In an optional implementation manner, the splitting of the leaderboard of each game team according to the elimination state of each game team in the current game process can be implemented by the following steps: and if the current game progress meets the preset condition, splitting the ranking list of the game teams according to the elimination state of each game team in the current game progress.

In an alternative embodiment, the preset condition may include any one or more of the following: the number of eliminated game teams reaches a preset threshold value; the game duration exceeds a preset duration.

In an optional implementation manner, the splitting of the leaderboard of each game team according to the elimination state of each game team in the current game process can be implemented by the following steps: determining a first target elimination line according to the elimination state of each game line in the current game process; deleting a first target elimination queue in the ranking list of the game team to obtain a first ranking list; and ranking the first target eliminating team based on the integral of the first target eliminating team to construct a second ranking list.

In an alternative embodiment, the following steps can also be performed: if there is a change in the elimination status of one or more game teams, the first ranking list and the second ranking list are updated based on the latest elimination status corresponding to the game team of which the elimination status has changed.

In an optional implementation manner, the updating the first ranking list and the second ranking list based on the latest elimination state corresponding to the game team with the changed elimination state may be implemented by the following steps: determining a second target elimination line from the game lines with the changed elimination states based on the latest elimination state corresponding to the game lines with the changed elimination states; deleting the second target eliminating team from the first ranking list; inserting the second target eliminating team into the second ranking list based on the score of the second target eliminating team.

In an alternative embodiment, the following steps can also be performed: if the first ranking list includes one or more points of the game team, updating the first ranking list based on the latest point corresponding to the game team with the changed points.

In an alternative embodiment, the following steps can also be performed: rendering the first and second leaderboards for display in a graphical user interface.

In an optional implementation manner, the first ranking board and the second ranking board include any one or more of the following: the game team ranking order, the game team name, the identity of one or more game characters used by the game team, the game team's battle performance data, the game team's tallies.

In an optional implementation, the rendering the first ranking board and the second ranking board may be implemented by: rendering the first ranking list based on the first preset configuration, and rendering the second ranking list based on the second preset configuration.

In an optional implementation, the rendering the first ranking board and the second ranking board may be implemented by: and rendering the identifiers of the game characters used by the game teams in the first ranking list based on the survival states corresponding to the game characters used by the game teams in the first ranking list.

The program product may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on an electronic device, such as a personal computer. However, the program product of the present disclosure is not limited thereto, and in this document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.

The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

A computer readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.

Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.

Program code for carrying out operations for the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).

The exemplary embodiment of the disclosure also provides an electronic device capable of implementing the ranking list processing method. An electronic device 600 according to this exemplary embodiment of the present disclosure is described below with reference to fig. 6. The electronic device 600 shown in fig. 6 is only an example and should not bring any limitations to the function and scope of use of the embodiments of the present disclosure.

As shown in fig. 6, electronic device 600 may take the form of a general-purpose computing device. The components of the electronic device 600 may include, but are not limited to: at least one processing unit 610, at least one memory unit 620, a bus 630 that couples various system components including the memory unit 620 and the processing unit 610, and a display unit 640.

The storage unit 620 stores program code that may be executed by the processing unit 610, such that the processing unit 610 performs the steps according to various exemplary embodiments of the present disclosure described in the above-mentioned "exemplary methods" section of this specification.

Specifically, the processing unit 610 may perform the following steps:

In an optional implementation manner, the splitting of the leaderboard of each game team according to the elimination state of each game team in the current game process can be implemented by the following steps: determining a first target elimination line according to the elimination state of each game line in the current game process; deleting a first target eliminating team in the ranking lists of the game teams to obtain a first ranking list; and ranking the first target eliminating team based on the integral of the first target eliminating team to construct a second ranking list.

In an optional implementation manner, the updating the first ranking board and the second ranking board based on the latest elimination state corresponding to the game team of which the elimination state changes can be implemented by the following steps: determining a second target elimination line from the game lines with the changed elimination states based on the latest elimination state corresponding to the game lines with the changed elimination states; deleting the second target eliminating team from the first ranking list; inserting the second target eliminating team into the second ranking list based on the score of the second target eliminating team.

In an optional implementation manner, the first ranking board and the second ranking board include any one or more of the following: a game team rank order, a game team name, an identification of one or more game characters used by a game team, battle performance data of a game team, tallies of a game team.

The storage unit 620 may include readable media in the form of volatile memory units, such as a random access memory unit (RAM) 621 and/or a cache memory unit 622, and may further include a read only memory unit (ROM) 623.

The storage unit 620 may also include a program/utility 624 having a set (at least one) of program modules 625, such program modules 625 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.

Bus 630 may be one or more of several types of bus structures, including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.

The electronic device 600 may also communicate with one or more external devices 700 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 600, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 600 to communicate with one or more other computing devices. Such communication may occur via an input/output (I/O) interface 650. Also, the electronic device 600 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network such as the Internet) via the network adapter 660. As shown in FIG. 6, the network adapter 660 communicates with the other modules of the electronic device 600 via the bus 630. It should be appreciated that although not shown in FIG. 6, other hardware and/or software modules may be used in conjunction with electronic device 600, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.

Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the exemplary embodiments of the present disclosure.

Furthermore, the above-described figures are merely schematic illustrations of processes included in methods according to exemplary embodiments of the present disclosure, and are not intended to be limiting. It will be readily appreciated that the processes illustrated in the above figures are not intended to indicate or limit the temporal order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.

It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functions of two or more modules or units described above may be embodied in one module or unit, according to exemplary embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.

As will be appreciated by one skilled in the art, aspects of the present disclosure may be embodied as a system, method or program product. Accordingly, various aspects of the disclosure may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system. Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice in the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.

It will be understood that the present disclosure is not limited to the precise arrangements that have been described above and shown in the drawings, and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is to be limited only by the following claims.

Claims

1. A ranking list processing method, the method comprising:

according to the credits of all game teams in the current game process, sequencing all game teams to obtain a ranking list of the game teams;

2. The method of claim 1, wherein splitting the leaderboard of the gaming team according to the elimination status of the gaming team in the current gaming session comprises:

and if the current game progress meets the preset conditions, splitting the ranking list of the game teams according to the elimination state of each game team in the current game progress.

3. The method of claim 2, wherein the preset conditions include any one or more of:

the number of eliminated game teams reaches a preset threshold value;

the game duration exceeds a preset duration.

4. The method of claim 1, wherein splitting the leaderboard of the gaming team according to the elimination status of the gaming team in the current gaming session comprises:

determining a first target elimination line according to the elimination state of each game line in the current game process;

deleting a first target eliminating team in the ranking lists of the game teams to obtain a first ranking list;

and ranking the first target eliminating team based on the integral of the first target eliminating team to construct a second ranking list.

5. The method of claim 4, further comprising:

if the elimination state of one or more game teams changes, updating the first ranking list and the second ranking list based on the latest elimination state corresponding to the game teams with the changed elimination state.

6. The method of claim 5, wherein updating the first and second leaderboards based on a latest culling status corresponding to a gaming team whose culling status changes comprises:

determining a second target elimination line from the game lines with the changed elimination states based on the latest elimination state corresponding to the game lines with the changed elimination states;

deleting the second target culling team from the first leaderboard;

inserting the second target eliminating team into the second leaderboard based on the score of the second target eliminating team.

7. The method of claim 4, further comprising:

if the points of one or more game teams in the first ranking list change, updating the first ranking list based on the latest points corresponding to the game teams with the changed points.

8. The method of claim 4, further comprising:

rendering the first leaderboard and the second leaderboard for display in a graphical user interface.

9. The method of claim 8, wherein the first leaderboard and the second leaderboard include any one or more of:

a game team rank order, a game team name, an identification of one or more game characters used by a game team, battle performance data of a game team, tallies of a game team.

10. The method of claim 8, wherein rendering the first leaderboard and the second leaderboard comprises:

rendering the first ranking list based on a first preset configuration, and rendering the second ranking list based on a second preset configuration.

11. The method of claim 8, wherein rendering the first leaderboard and the second leaderboard comprises:

rendering the identifiers of the game characters used by the game teams in the first ranking list based on the survival states corresponding to the game characters used by the game teams in the first ranking list.

12. A leaderboard processing apparatus, the apparatus comprising:

the first sequencing module is used for sequencing all game teams according to the scores of all the game teams in the current game process to obtain a game team ranking list;

and the second ranking module is used for splitting the ranking list of the game teams according to the elimination state of each game team in the current game process.

13. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method of any one of claims 1 to 11.

14. An electronic device, comprising:

a processor; and

a memory for storing executable instructions of the processor;

wherein the processor is configured to perform the method of any of claims 1 to 11 via execution of the executable instructions.