CN113742568A - Information display method, electronic device, and computer-readable medium - Google Patents
Information display method, electronic device, and computer-readable medium Download PDFInfo
- Publication number
- CN113742568A CN113742568A CN202010478695.XA CN202010478695A CN113742568A CN 113742568 A CN113742568 A CN 113742568A CN 202010478695 A CN202010478695 A CN 202010478695A CN 113742568 A CN113742568 A CN 113742568A
- Authority
- CN
- China
- Prior art keywords
- candidate information
- information
- information list
- candidate
- list
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 65
- 230000004044 response Effects 0.000 claims abstract description 42
- 238000012545 processing Methods 0.000 claims abstract description 18
- 230000001419 dependent effect Effects 0.000 claims abstract description 7
- 238000012163 sequencing technique Methods 0.000 claims abstract description 7
- 239000011159 matrix material Substances 0.000 claims description 135
- 238000004422 calculation algorithm Methods 0.000 claims description 34
- 238000010187 selection method Methods 0.000 abstract description 3
- 238000010586 diagram Methods 0.000 description 11
- 230000008569 process Effects 0.000 description 10
- 238000004590 computer program Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 8
- 238000004891 communication Methods 0.000 description 7
- 238000004364 calculation method Methods 0.000 description 5
- 230000003287 optical effect Effects 0.000 description 4
- 230000009286 beneficial effect Effects 0.000 description 3
- 238000012795 verification Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 238000010845 search algorithm Methods 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 230000001174 ascending effect Effects 0.000 description 1
- 239000003795 chemical substances by application Substances 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007613 environmental effect Effects 0.000 description 1
- 239000002360 explosive Substances 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9538—Presentation of query results
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9535—Search customisation based on user profiles and personalisation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0201—Market modelling; Market analysis; Collecting market data
- G06Q30/0202—Market predictions or forecasting for commercial activities
Abstract
The embodiment of the disclosure discloses an information display method, an electronic device and a computer readable medium. One embodiment of the method comprises: acquiring equipment information of electronic equipment for generating a target information list; determining whether the electronic device is a predetermined type of terminal based on device information of the electronic device; in response to determining that the electronic device is not a predetermined type of terminal, performing a first mode-dependent processing step of: receiving payment information and a first candidate information list sent by a user terminal; generating a second candidate information list; carrying out numerical sorting on the second candidate information list to generate a third candidate information list; and performing time sequencing on the third candidate information list, generating a target information list and displaying the target information list. The method for determining the information display according to the equipment information of the electronic equipment can automatically generate a target information list meeting the requirements of a user by using a dynamic programming selection method, and provides a basis for the user to finally select the information.
Description
Technical Field
The disclosed embodiments relate to the field of computer technologies, and in particular, to an information display method, an electronic device, and a computer-readable medium.
Background
The rapid development of the internet and the ever-increasing information resources lead to the explosive increase of information indexes, and the intervention of the internet also changes the shopping mode of the traditional retail industry. More and more off-line retail enterprises expand own business by combining shopping scenes of the Internet, and information resources such as off-line shopping tickets, goods picking tickets and the like are expected to be used on line. Specifically, it is desirable to actively provide a user with a desired target information list based on analyzing and predicting user needs with the user as a center, and to show the user with more useful information according to the situation of the device used by the user in different environmental situations.
Disclosure of Invention
The embodiment of the disclosure provides an information display method, electronic equipment and a computer readable medium.
In a first aspect, an embodiment of the present disclosure provides an information display method, where the method includes: acquiring equipment information of electronic equipment for generating a target information list; determining whether the electronic device is a predetermined type of terminal based on device information of the electronic device; in response to determining that the electronic device is not a predetermined type of terminal, performing a first mode-dependent processing step of: setting an operation mode of the electronic equipment to be a first mode; receiving payment information and a first candidate information list sent by a user terminal, wherein the first candidate information list comprises a first number of candidate information; generating a second candidate information list based on a dynamic programming algorithm, the payment information and the first candidate information list; carrying out numerical sorting on the second candidate information list to generate a third candidate information list; and performing time sequencing on the third candidate information list, generating a target information list and displaying the target information list.
In some embodiments, an information display method further comprises: in response to determining that the electronic device is a predetermined type of terminal, performing the following second mode-dependent processing steps: setting the operation mode of the electronic equipment to be a second mode; receiving payment information and a first candidate information list sent by a user terminal; generating a fourth candidate information list based on the dynamic programming algorithm, the payment information and the first candidate information list; determining the fourth candidate information list as a target information list in response to the sum of the values included in the candidate information in the fourth candidate information list being equal to the payment information; in response to the fact that the sum of numerical values included in the candidate information in the fourth candidate information list is smaller than the payment information, conducting numerical value sorting on the fourth candidate information list to generate a fifth candidate information list, conducting time sorting on the fifth candidate information list to generate a first target information list; and generating second payment information in response to the fact that the sum of the numerical values of the candidate information in the fourth candidate information list is larger than the payment information, generating a second target information list based on the second payment information, and determining the first target information list and the second target information list as target information lists.
In some embodiments, an information display method further comprises: and responding to the first number of information contained in the target information list, sending the target information list to the equipment supporting prompting, and controlling the equipment to send out prompting information.
In some embodiments, generating the second list of target information based on the second payment information comprises: inputting the second payment information and the first candidate information list into the dynamic planning model, and determining the obtained output as a sixth candidate information list; carrying out numerical sorting on the sixth candidate information list to generate a seventh candidate information list; and carrying out time sequencing on the seventh candidate information list to generate a second target information list.
In some embodiments, generating the second candidate information list based on the dynamic programming algorithm, the payment information, and the first candidate information list comprises: generating a dynamic planning matrix based on the payment information and the first candidate information list, wherein the dynamic planning matrix is a zero matrix; for each information in the first candidate information list, updating the state in the dynamic programming matrix corresponding to the information based on the state of the information in the dynamic programming matrix corresponding to the previous information in the first candidate information list to obtain an updated dynamic programming matrix; and generating a second candidate information list based on the updated dynamic programming matrix.
In some embodiments, the dynamic programming matrix includes a first number of rows and the dynamic programming matrix includes a numerical number of columns of payment information.
In some embodiments, for each information in the first candidate information list, updating a state in a dynamic programming matrix corresponding to the previous information in the first candidate information list based on the state of the information in the dynamic programming matrix corresponding to the previous information, and generating an updated dynamic programming matrix, the method includes: determining the serial number i of the information in the first candidate information list; determining a value j of the information; in response to the information being the first information in the first candidate information list, setting the element value of the ith row and the 0 th column in the dynamic programming matrix to 1, and setting the element value of the ith row and the jth column in the dynamic programming matrix to 1; and in response to the information not being the first information in the first candidate information list, setting the value of the relevant element of the ith row in the dynamic programming matrix to be 1 based on the state of the information in the dynamic programming matrix corresponding to the previous information in the first candidate information list.
In some embodiments, generating the second candidate information list based on the updated dynamic programming matrix comprises: searching the r-th row corresponding to the maximum combined amount from the updated dynamic programming matrix, wherein the combined amount refers to the sum of the element values of each row in the dynamic programming matrix; and determining the information in the first candidate information list corresponding to the element with the value of 1 in the r-th row as the information in the second candidate information list.
In some embodiments, numerically sorting the second candidate list of information to generate a third candidate list of information comprises: and reordering all information in the second candidate information list according to the numerical value from small to large to obtain a third candidate information list.
In some embodiments, time-ordering the third candidate information list to generate the target information list comprises: reordering all the information in the third candidate information list according to the order of the expiration time from large to small to obtain an eighth candidate information list; for each piece of information in the third candidate information list, responding to the information containing at least two pieces of information with the same numerical value in the second candidate information list, and finding out target information with the minimum expiration time by utilizing a binary algorithm; in response to the target information not being the corresponding information with the same value in the eighth candidate information list, replacing the target information with the corresponding information with the same value in the eighth candidate information list; and outputting the eighth candidate information list as a target information list.
The embodiment of the disclosure provides an information display method, which includes acquiring device information of an electronic device used for generating a target information list; determining whether the electronic device is a predetermined type of terminal based on device information of the electronic device; in response to determining that the electronic device is not a predetermined type of terminal, performing a first mode-dependent processing step of: receiving payment information and a first candidate information list sent by a user terminal; generating a second candidate information list; carrying out numerical sorting on the second candidate information list to generate a third candidate information list; and performing time sequencing on the third candidate information list, generating a target information list and displaying the target information list.
One of the above-described various embodiments of the present disclosure has the following advantageous effects: and automatically generating a second candidate information list by using a dynamic programming method according to a method for automatically determining information display of the equipment information of the electronic equipment for generating the target information list, and automatically generating and displaying the target information list after numerical sorting and time sorting are carried out on the second candidate information list. The method for determining the information display according to the equipment information of the electronic equipment can automatically generate a target information list meeting the requirements of a user by using a dynamic programming selection method, and provides a basis for the user to finally select the information.
Drawings
Other features, objects and advantages of the disclosure will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
FIG. 1 is an architectural diagram of an exemplary system in which some embodiments of the present disclosure may be applied;
FIG. 2 is a flow diagram for some embodiments of an information display method according to the present disclosure;
FIG. 3 is a flow diagram of further embodiments of some embodiments for an information display method according to the present disclosure;
FIG. 4 is a flow diagram of further embodiments of a dynamic programming algorithm according to the present disclosure;
FIG. 5 is a flow diagram of further embodiments of some embodiments for an information display method according to the present disclosure;
FIG. 6 is a schematic structural diagram of an electronic device suitable for use in implementing some embodiments of the present disclosure.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it is to be understood that the disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the disclosure are for illustration purposes only and are not intended to limit the scope of the disclosure.
It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings. The embodiments and features of the embodiments in the present disclosure may be combined with each other without conflict.
It is noted that references to "a", "an", and "the" modifications in this disclosure are intended to be illustrative rather than limiting, and that those skilled in the art will recognize that "one or more" may be used unless the context clearly dictates otherwise.
The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Fig. 1 illustrates an exemplary system architecture 100 to which embodiments of the information display method of the present disclosure may be applied.
As shown in fig. 1, the system architecture 100 may include electronic devices 101, 102, 103, a network 104, and a server 105. The network 104 is used to provide a medium for communication links between the electronic devices 101, 102, 103 and the server 105. Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
A user may use the electronic devices 101, 102, 103 to interact with the server 105 over the network 104 to receive or send messages or the like. The electronic devices 101, 102, 103 may have installed thereon various communication client applications, such as a text processing application, an information display application, a question and answer system application, and the like.
The electronic devices 101, 102, and 103 may be hardware or software. When the electronic devices 101, 102, 103 are hardware, they may be various electronic devices having a display screen, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like. When the electronic devices 101, 102, 103 are software, they can be installed in the electronic devices listed above. It may be implemented as multiple pieces of software or software modules, or as a single piece of software or software module. And is not particularly limited herein.
The server 105 may be a server that provides various services, such as a server that processes payment information and a first candidate information list input by the electronic devices 101, 102, 103 and provides an information display function, a server that processes information input by the electronic devices 101, 102, 103 and provides an information display function, and the like.
It should be noted that the information display method provided by the embodiment of the present disclosure is generally executed by the server 105, and accordingly, the device for finally displaying information is generally disposed in the server 105.
It should be noted that the local area of the server 105 may also directly store data, and the server 105 may directly extract the local payment information and the first candidate information list to obtain the information display result through processing, in which case, the exemplary system architecture 100 may not include the electronic devices 101, 102, 103 and the network 104.
It should be noted that the electronic devices 101, 102, and 103 may also be installed with an information display application, and in this case, the electronic devices 101, 102, and 103 may also execute an information display method. At this point, the exemplary system architecture 100 may also not include the server 105 and the network 104.
The server 105 may be hardware or software. When the server 105 is hardware, it may be implemented as a distributed server cluster composed of a plurality of servers, or may be implemented as a single server. When the server is software, it may be implemented as a plurality of software or software modules (for example, for providing an information display service), or may be implemented as a single software or software module. And is not particularly limited herein.
It should be understood that the number of electronic devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of electronic devices, networks, and servers, as desired for implementation.
With continued reference to fig. 2, a flow 200 for some embodiments of an information display method according to the present disclosure is shown. The method for displaying information comprises the following steps:
In some embodiments, an execution subject (e.g., a server shown in fig. 1) for the information display method may collect device information of an electronic device for generating the target information list. Optionally, the electronic device for generating the target information list may be an application program, or may be a shopping terminal. An application refers to a program or software designed to run on a smartphone, tablet, and other mobile devices. The shopping terminal is a physical shopping machine and comprises a display touch screen, a main panel and a base. The main panel is installed on the base, and the display touch screen is installed on the surface of the main panel. A shopping control system is arranged in the display touch screen and used for a user to purchase commodities and a merchant to manage the commodities.
In some embodiments, the execution main body determines whether the electronic device is a predetermined type terminal based on the obtained device information of the electronic device. Optionally, the predetermined type is an intelligent shopping terminal type. The device information of the electronic device may be application device information and shopping terminal device information. Comparing the device information of the electronic device with a predetermined type, it can be determined whether the electronic device is a terminal of the predetermined type.
In some embodiments, the executing body executes the first mode-dependent steps one to five below in response to determining that the electronic device is not a predetermined type of terminal.
The method comprises the following steps: and controlling the electronic equipment, and setting the running mode of the electronic equipment to be a first mode.
The operation mode refers to a calculation scheme, codes, a workflow and the like adopted by the electronic equipment to meet the requirements of users. The electronic equipment adopting different operation modes executes different work flows and obtains different information. Optionally, the first mode may be an application run mode. And responding to the operation mode of the electronic equipment as a first mode, and executing the task steps related to the first mode by the execution main body. Optionally, the execution main body executes an operation flow of the application program.
Step two: and receiving the payment information and the first candidate information list sent by the user terminal.
The execution main body receives payment information and a first candidate information list sent by the user terminal. Wherein the first candidate information list comprises a first number of candidate information. The candidate information may be a coupon. The first candidate list may include a first number of coupons. The pick ticket may be an electronic voucher serial number or a two-dimensional code generated via an encoded voucher platform. After the user passes the verification by means of the bill of lading to a designated place, the user can take the product corresponding to the amount of the bill of lading or enjoy the corresponding service. The payment information may be an amount that the user plans to shop.
Step three: a second candidate information list is generated based on the dynamic programming algorithm, the payment information, and the first candidate information list.
In some embodiments, the executing entity generates the second candidate information list based on the dynamic programming algorithm, the payment information, and the first candidate information list. Optionally, the dynamic planning algorithm generates a dynamic planning matrix by using the payment information and the first candidate information list. And updating the dynamic programming algorithm to generate a second candidate information list. A dynamic planning matrix is generated based on the payment information and the first list of candidate information. Wherein the dynamic programming matrix is a zero matrix. Optionally, the dynamic programming matrix comprises a first number of rows, and the dynamic programming matrix comprises a number of columns of the number of values of the payment information. Specifically, for the first candidate information list n ═ {2, 2, 4, 6, 3}, the numerical values in the information list represent the amount of money, unit units. Wherein, the first candidate information list includes 5 candidate information, and the first number is 5. The payment information "a ═ 9, and the value 9 indicates the amount of money, unit dollars". Specifically, the dynamic programming matrix is as follows:
each candidate information corresponds to a row in the dynamic programming matrix, and each value in the row corresponds to a state of the candidate information in the dynamic matrix. For the first candidate information list n ═ {2, 2, 4, 6, 3}, the values in the information list represent amounts of money, units, "2" is ordered first, corresponding to row 0 in the dynamic programming matrix. "2" is ordered second, corresponding to row 1 in the dynamic programming matrix. "4" is ordered to the third, corresponding to row 2 in the dynamic programming matrix. "6" is ordered fourth, corresponding to row 3 in the dynamic programming matrix. "3" is ordered as the fifth, corresponding to row 4 in the dynamic programming matrix. "6" is the previous of "3".
And for each information in the first candidate information list, updating the state in the dynamic programming matrix corresponding to the information based on the state of the information in the dynamic programming matrix corresponding to the previous information in the first candidate information list, and obtaining the updated dynamic programming matrix. For each information in the first candidate information list, the state of the information in the dynamic programming matrix refers to a value of the information corresponding to each element in a row in the dynamic programming matrix. Optionally, the value may be "1", indicating that the element is selected. The value may be "0" indicating that the element is not selected. Specifically, in the dynamic programming matrix, the first candidate information "2" in the first candidate information list corresponds to the first row in the dynamic programming matrix. Each element value in the first row is "0", which means that the element is not selected in the initial state under different payment values (different columns).
And generating a second candidate information list based on the updated dynamic programming matrix. And searching for an element with the value of 1 and a value closest to the payment information a in the last row of the updated dynamic programming matrix. Specifically, the payment information "a" is 9, and the value 9 indicates the amount of money, unit. For all elements "0", "1" in the last row, the closest payment information "a is 9, the value 9 represents the amount of money, and the sum of all values of the unit cell" is 8. And generating information in a second candidate information list according to the information in the first candidate information list corresponding to the element with the value of 1 in the fifth row, wherein the second candidate information list is n2 ═ {2, 4, 6, 3, 2}, and the values in the information list represent money amount and unit elements.
And fourthly, carrying out numerical sorting on the second candidate information list to generate a third candidate information list.
In some embodiments, the execution subject reorders all the information in the second candidate information list according to a descending order of the numerical values to obtain a third candidate information list. Specifically, for the first candidate information list n ═ {2, 2, 4, 6, 3}, the numerical values in the information list represent the amount of money, unit units. The payment information "a ═ 6, and the value 6 indicates the amount of money, unit dollars". The second candidate information list obtained is n2 ═ {2, 4, 6, 3, 2}, and the numerical values in the information list represent the amount of money, unit dollars.
Optionally, all the candidate information in the second candidate information list is reordered from small to large in numerical value, so as to obtain a third candidate information list n3 ═ {2, 2, 3, 4, 6}, where the numerical values in the information list represent money amount and unit.
And fifthly, time sorting is carried out on the third candidate information list, and a target information list is generated and displayed.
In some embodiments, the execution subject performs time sorting on the third candidate information list to generate a target information list. And reordering all candidate information in the third candidate information list according to the order of the expiration time from large to small to obtain an eighth candidate information list. Specifically, for the first candidate information list n ═ {2, 2, 4, 6, 3}, the numerical values in the information list represent the amount of money, unit units. The payment information "a ═ 5, and the value 5 indicates the amount of money, unit dollars". The third candidate information list is n3 ═ {2, 2, 3, 4, 6}, and the numerical values in the information list represent money amount, unit. Two candidate messages with the value of "2" exist in the third candidate message list, and the expiration times of the two candidate messages with the value of "2" are different. The expiration time of the candidate information can represent the validity period of the picking ticket, the candidate information with short expiration time has short validity period, and the candidate information with long expiration time has long validity period. Specifically, the eighth candidate information list is n8 ═ {2, 2, 3, 4, 6}, and the numerical values in the information list indicate the amount of money and the unit number. Wherein the first "2" has an expiration time greater than the expiration time of the second "2".
Optionally, for each candidate message in the third candidate message list, in response to that at least two candidate messages with the same value as the candidate message exist in the second candidate message list, the target message with the minimum expiration time is found by using a binary algorithm. For the third candidate information list n3 ═ {2, 2, 3, 4, 6}, the values in the information list represent amounts of money, units. For the first candidate information "2", n2 ═ {2, 4, 6, 3, 2} in the second candidate information list, the numerical value in the information list represents the amount of money, the unit cell, and two candidate information "2" and "2" having the same numerical value can be found. And finding out the second target information with the sorted expiration time, namely the second 2, by utilizing a bisection algorithm.
Optionally, the dichotomy algorithm is a search algorithm for finding a specific element in the ordered array. The search process starts with the middle element of the array, and ends if the middle element happens to be the element to be looked up. If a particular element is larger or smaller than the intermediate element, then the search is made in the half of the array that is larger or smaller than the intermediate element and the comparison is started from the intermediate element as was done at the beginning. If at some step the array is empty, the delegate cannot be found. Each comparison of this search algorithm reduces the search range by half.
And in response to the target information not being the corresponding candidate information with the same value in the eighth candidate information list, replacing the target information with the corresponding candidate information with the same value in the eighth candidate information list. No operation is performed in response to the target information being the corresponding candidate information of the same value in the eighth candidate information list. And outputting the eighth candidate information list as a target information list.
Optionally, the executing body responds to that the target information list contains the first number of pieces of information, sends the target information list to the device supporting the prompt, and controls the device to send out the prompt information according to the received target information list. For example, the target information list includes a list of bills of lading recommended to the user in order of use. When the target information list is sent to the device supporting the prompt, the device sends out the prompt information. The prompt information is sent out, so that the shopping selection and judgment time of the user can be shortened, and the shopping efficiency of the user is improved. The implementation mode can be used in the fields of shopping settlement assistance and the like, is favorable for prompting the user to make shopping judgment, and improves the shopping satisfaction of the user.
One embodiment presented in fig. 2 has the following beneficial effects: and automatically generating a second candidate information list by using a dynamic programming method according to a method for automatically determining information display of the equipment information of the electronic equipment for generating the target information list. And arranging the second candidate information list according to the ascending order (from small to large) of the face value, and realizing numerical sorting by using a dynamic programming algorithm. The third candidate list is sorted according to the descending order of the expiration time (from the expiration time to the minimum), and the candidate information can be quickly replaced by the nearest expiration time by combining a dichotomy algorithm. The method for determining the information display according to the equipment information of the electronic equipment can automatically generate and display a target information list meeting the requirements of a user by using a dynamic programming selection method, and provides a basis for the user to finally select the information.
With continued reference to fig. 3, fig. 3 illustrates a flow 300 for further embodiments of some embodiments of an information display method according to the present disclosure. The method for displaying information may include the steps of:
In some embodiments, the executing body controls the electronic device to set the operation mode of the electronic device to the second mode in response to determining that the electronic device is a predetermined type of terminal. The operation mode refers to a calculation scheme, codes, a workflow and the like adopted by the electronic equipment to meet the requirements of users. The electronic equipment adopting different operation modes executes different work flows and obtains different information. Optionally, the second mode may be a shopping terminal mode of operation. The shopping terminal is a physical shopping machine and comprises a display touch screen, a main panel and a base. The main panel is installed on the base, and the display touch screen is installed on the surface of the main panel. A shopping control system is arranged in the display touch screen and used for a user to purchase commodities and a merchant to manage the commodities. And responding to the operation mode of the electronic equipment as a second mode, and executing the task steps related to the second mode by the execution main body. Optionally, the executing body executes an operation flow of the shopping terminal.
In some embodiments, the execution subject receives the payment information and the first candidate information list from the user terminal. Wherein the first candidate information list comprises a first number of candidate information. The candidate information may be a coupon, and the first list of candidate information may include a first number of coupons. The goods-picking ticket can be an electronic certificate serial number or a two-dimensional code generated by the coding certificate platform, and a user can pick up a product corresponding to the money amount of the goods-picking ticket or enjoy corresponding services after the goods-picking ticket passes verification in a specified place. The payment information may be an amount that the user plans to shop.
In some embodiments, the executing entity generates a dynamic planning matrix based on the payment information and the first candidate information list, wherein the dynamic planning matrix is a zero matrix. Optionally, the dynamic programming matrix comprises a first number of rows, and the dynamic programming matrix comprises a number of columns of the number of values of the payment information. For each candidate information in the first candidate information list, each candidate information is arranged in order. Specifically, for the first candidate information list n ═ {2, 2, 4, 6, 3}, the numerical values in the information list represent the amount of money, unit units. "2" is ordered first, corresponding to row 0 in the dynamic programming matrix. "2" is ordered second, corresponding to row 1 in the dynamic programming matrix. "4" is ordered to the third, corresponding to row 2 in the dynamic programming matrix. "6" is ordered fourth, corresponding to row 3 in the dynamic programming matrix. "3" is ordered as the fifth, corresponding to row 4 in the dynamic programming matrix. "6" is the previous of "3". Each candidate information corresponds to a row in the dynamic programming matrix. See in particular the following matrix:
initial state
Where k1 denotes the first candidate information, k2 denotes the second candidate information, k3 denotes the third candidate information, k4 denotes the fourth candidate information, and k5 denotes the fifth candidate information. Each candidate information corresponds to a row in the dynamic programming matrix, and each value in the row corresponds to a state of the candidate information in the dynamic matrix. And updating the state in the dynamic programming matrix corresponding to the candidate information based on the state of the candidate information in the dynamic programming matrix corresponding to the previous candidate information in the first candidate information list to obtain the updated dynamic programming matrix.
And searching for an element with the value of 1 in the last row of the updated dynamic programming matrix, and determining the value closest to the payment information a. And matching the element with the value of 1 in the last row with the payment information a to generate a fourth candidate information list.
In step 304, the fourth candidate information list is determined as the target information list in response to the sum of the values included in the candidate information in the fourth candidate information list being equal to the value included in the payment information.
In some embodiments, the executing agent directly determines the fourth candidate information list as the target information list in response to a sum of values included in the candidate information in the fourth candidate information list being equal to the payment information included in the payment information.
In some embodiments, the executing entity reorders all the information in the fourth candidate information list according to the order of the numerical values from small to large in response to the sum of the numerical values included in the candidate information in the fourth candidate information list being smaller than the payment information, so as to obtain a fifth candidate information list.
And reordering all candidate information in the fifth candidate information list according to the order of the expiration time from large to small to obtain a first target information list. The expiration time of the candidate information can represent the validity period of the picking ticket, the candidate information with short expiration time has short validity period, and the candidate information with long expiration time has long validity period. Optionally, for each candidate information in the fifth candidate information list, in response to that the candidate information includes at least two candidate information with the same value in the fourth candidate information list, the target information with the minimum expiration time is found by using a bisection algorithm.
Optionally, the executing body generates the second payment information in response to that the sum of the values of the candidate information in the fourth candidate information list is greater than the payment information. Optionally, a binary algorithm is used to find the first value that is greater than the payment information. When there is no value greater than the payment information, the values are added in order from large to small until the value is greater than the payment information, and the value is determined as the second payment information.
And generating a sixth candidate information list based on the dynamic programming algorithm, the second payment information and the first candidate information list. And carrying out numerical sorting on the sixth candidate information list to generate a seventh candidate information list. And carrying out time sequencing on the seventh candidate information list to generate a second target information list.
Optionally, the executing body determines the first target information list and the second target information list as target information lists, and displays the target information lists.
One embodiment presented in fig. 3 has the following beneficial effects: and determining the running mode of the electronic equipment of the terminal of the preset type as a second mode, and determining a fourth candidate information list by using a dynamic programming method. And in response to the fact that the sum of the numerical values included in the candidate information in the fourth candidate information list is equal to the payment information included in the payment information, directly determining the fourth candidate information list as the target information list and displaying the target information list. And respectively generating a first target information list and a second target information list, wherein the sum of the numerical values of the candidate information in the fourth candidate information list is not equal to the payment information in the payment information, the sum of the numerical values of the candidate information in the fourth candidate information list is greater than the payment information, and the sum of the numerical values of the candidate information in the fourth candidate information list is less than the payment information, and determining and displaying the first target information list and the second target information list as target information lists. When the dynamic programming is used for generating the second target information list, the first number larger than the payment information value is found by preferentially using a binary algorithm or is sequentially added from large to small until the number larger than the payment information value is obtained, so that the occupied space of the memory is reduced, and the execution time of the algorithm is improved. The method can provide different target information lists for the electronic equipment of the terminal with the preset type, meet different requirements of the user and provide a basis for the user to finally select information.
With further reference to fig. 4, a flow 400 of further embodiments of a dynamic programming algorithm according to the present disclosure is illustrated. The process 400 of the dynamic programming algorithm includes the following steps:
In some embodiments, an executing entity (e.g., a server shown in fig. 1) for the information display method generates a dynamic programming matrix based on the payment information and the first candidate information list, wherein the dynamic programming matrix is a zero matrix. Optionally, the dynamic programming matrix comprises a first number of rows, and the dynamic programming matrix comprises a number of columns of the number of values of the payment information. Specifically, for the first candidate information list n ═ {2, 2, 4, 6, 3}, the numerical values in the information list represent the amount of money, unit units. Wherein, the first candidate information list comprises 5 candidate information, and the first number is 5. The payment information "a ═ 9, and the value 9 indicates the amount of money, unit dollars". Specifically, the dynamic programming matrix is
Initial state
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 |
In some embodiments, the performing the solving process of the subject determining the first number of stages corresponds to the first number of candidate information included in the first candidate information list. The processing of each candidate is considered a processing stage. For each stage, a decision is made whether to place a candidate message in the second candidate message list. After each candidate message is decided, the first candidate message list can reach various different states. The set of states for the next stage is then derived based on the set of states for the previous stage. By combining the repeated states in each stage, the number of different states in each stage is ensured not to exceed the number of the payment information. Specifically, for the first candidate information list n ═ {2, 2, 4, 6, 3}, the numerical values in the information list represent the amount of money, unit units. Wherein, the first candidate information list comprises 5 candidate information, and the first number is 5. The payment information "a ═ 9, and the value 9 indicates the amount of money, unit dollars". The number of different states in each stage will not exceed 9.
A two-dimensional array states [ n ] [ a +1] is defined to record different states that each element in the dynamic programming matrix at each stage can reach. Wherein states represents a dynamic programming matrix, n represents the number of candidate information in the first candidate information list, and a represents the numerical amount of the payment information.
For each candidate information in the first candidate information list, performing the following step six, and updating the dynamic programming matrix:
step six: the sequence number i of the candidate information in the first candidate information list is determined, and the value j of the candidate information is determined.
And in response to the candidate information being the first candidate information in the first candidate information list, setting the element value of the ith row and the 0 th column in the dynamic programming matrix to be 1, and setting the element value of the ith row and the jth column in the dynamic programming matrix to be 1. Specifically, for the first candidate information list n ═ {2, 2, 4, 6, 3}, the numerical values in the information list represent the amount of money, unit units. Wherein, the first candidate information list comprises 5 candidate information, and the first number is 5. The payment information "a ═ 9, and the value 9 indicates the amount of money, unit dollars". The value of the 0 th (subscript numbered from 0) candidate is "2", and after the decision is completed, the result corresponds to two states of the decision, wherein the combination is "0" or "2". The two states are denoted by states [0] [0] true and states [0] [2] true. After the decision of the first candidate information is finished, the dynamic programming matrix is updated as follows:
after the 0 th coupon decision
And in response to the information not being the first candidate information in the first candidate information list, setting the value of the relevant element of the ith row in the dynamic programming matrix to be 1 based on the state of the candidate information in the dynamic programming matrix corresponding to the previous candidate information in the first candidate information list. Specifically, the 1 st candidate information is "2", and after the candidate information is decided, there are 3 different states, specifically, states [1] [0] ═ true, states [1] [2] ═ true, and states [1] [4] ═ true, based on the previous combination state.
And step six is executed until all candidate information is decided, and the whole states state array is calculated. The following matrix can be seen in particular:
after the 1 st coupon decision
After the 2 nd coupon decision
After the 3 rd ticket is decided
After the 4 th coupon decision
Wherein, 0-9(a) represents the state value which can be reached after each coupon decision is finished, 0 represents false and 1 represents true in the table. And the 4 th ticket decision matrix is an updated dynamic programming matrix.
In some embodiments, the executing entity searches for an element with a value of "1" and a value closest to the payment information a in the last row of the updated dynamic programming matrix. Specifically, the payment information "a" is 9, and the value 9 indicates the amount of money, unit. For all the elements "1", "0", "1" in the last row, the closest payment information "a is 9, the value 9 represents the amount of money, and the sum of all the values of the unit cell" is 9. And determining the information in the first candidate information list corresponding to the element with the value of 1 in the last row as the information in the second candidate information list to obtain the second candidate information list n2 ═ 3, 6, wherein the values in the information list represent money and unit elements.
The dynamic programming method adopts two-dimensional array storage, and responds to the conditions that the number of elements is excessive, the numerical value of payment information is too large, the memory of an execution main body is too small, the memory overflow can be caused when the memory space is initialized, and extreme conditions are specially processed for the robustness and reliability of the system.
Judging whether the threshold value set by the algorithm is exceeded or not: n × a >100000000, where n denotes the number of candidate information in the first candidate information list, and a denotes the numerical amount of the payment information. Alternatively, the algorithm threshold may be n-1000, a-1000, or n-100, and a-10000. In response to exceeding the threshold, the binary algorithm is used directly to find the one candidate closest to a, and the dynamic programming method is no longer performed.
One embodiment presented in fig. 4 has the following beneficial effects: the decision process of the candidate information is designed into a dynamic programming matrix by using a dynamic programming algorithm, the processing process of each candidate information is regarded as a processing stage, and the dynamic programming matrix is updated in a layered mode, so that exponential increase of the number of states of each layer is avoided, the calculation complexity is reduced, the user requirement can be responded quickly, and the user satisfaction is improved. In order to avoid the problem of memory overflow, when the number of the candidate information and the value of the payment information exceed threshold values, the candidate information which is closest to the value amount of the payment information is searched by a binary algorithm and directly returned to the user, so that the requirements of the user can be met, and the stability and the reliability of the system are ensured.
With continued reference to fig. 5, fig. 5 illustrates a flow 500 of further embodiments of some embodiments for an information display method according to the present disclosure. The method for displaying information may include the steps of:
In some embodiments, the executing body controls the electronic device to set the operation mode of the electronic device to the first mode in response to determining that the electronic device is not the predetermined type of terminal. The operation mode refers to a calculation scheme, codes, a workflow and the like adopted by the electronic equipment to meet the requirements of users. The electronic equipment adopting different operation modes executes different work flows and obtains different information. Optionally, the first mode may be an application run mode. And responding to the operation mode of the electronic equipment as a first mode, and executing the task steps related to the first mode by the execution main body. Optionally, the execution main body executes an operation flow of the application program.
In some embodiments, the execution subject receives the payment information and the first candidate information list from the user terminal. Wherein the first candidate information list comprises a first number of candidate information. The candidate information may be a coupon, and the first list of candidate information may include a first number of coupons. The goods-picking ticket can be an electronic certificate serial number or a two-dimensional code generated by the coding certificate platform, and a user can pick up a product corresponding to the money amount of the goods-picking ticket or enjoy corresponding services after the goods-picking ticket passes verification in a specified place. The payment information may be an amount that the user plans to shop.
In some embodiments, the execution body may first sort the first candidate information list, and the rule of the sorting may include a numerical size and an expiration time. The expiration time of each candidate message in the candidate message list can represent the validity period of the picking note, the candidate messages with short expiration time have short validity period, and the candidate messages with long expiration time have long validity period.
Optionally, all the information in the first candidate information list is reordered according to the descending order of the numerical values, and then reordered according to the descending order of the expiration time, so as to generate an eighth candidate information list.
Optionally, the expiration time of the candidate information may represent the validity period of the pick-up ticket, the candidate information with short expiration time has a short validity period, and the candidate information with long expiration time has a long validity period. Optionally, all the information in the first candidate information list is reordered according to the order of the numerical values from small to large, and for each piece of reordered information, in response to the fact that the information contains at least two pieces of candidate information with the same numerical value in the first candidate information list, a bisection algorithm is used to find the target information with the minimum expiration time. And reordering according to the order of the expiration times from large to small to generate an eighth candidate information list.
Specifically, for the first candidate information list n ═ {2, 2, 4, 6, 3}, the numerical values in the information list represent the amount of money, unit units. Wherein, the first candidate information list includes 5 candidate information, and the first number is 5. The payment information "a ═ 9, and the value 9 indicates the amount of money, unit dollars". After the first candidate information list is sorted, an eighth candidate information list n8 is generated as {2, 2, 3, 4, 6}, and the numerical values in the information list represent money amount and unit bit.
Step 504, a target information list is generated based on the dynamic programming algorithm, the payment information and the eighth candidate information list.
In some embodiments, the executing entity generates a dynamic programming matrix based on the payment information and the eighth candidate information list, wherein the dynamic programming matrix is a zero matrix. Optionally, the dynamic programming matrix comprises a first number of rows, and the dynamic programming matrix comprises a number of columns of the number of values of the payment information. For each candidate information in the eighth candidate information list, each candidate information is arranged in order. Each candidate information corresponds to a row in the dynamic programming matrix, and each value in the row corresponds to a state of the candidate information in the dynamic matrix. Specifically, for the eighth candidate information list n8 ═ {2, 2, 3, 4, 6}, the numerical values in the information list represent the amount of money, unit dollars. Wherein, the first candidate information list includes 5 candidate information, and the first number is 5. The payment information "a ═ 9, and the value 9 indicates the amount of money, unit dollars". Specifically, the dynamic programming matrix is as follows:
where k1 denotes the first candidate information in the eighth candidate information list, k2 denotes the second candidate information in the eighth candidate information list, k3 denotes the third candidate information in the eighth candidate information list, k4 denotes the fourth candidate information in the eighth candidate information list, and k5 denotes the fifth candidate information in the eighth candidate information list. Each candidate information corresponds to a row in the dynamic programming matrix, and each value in the row corresponds to a state of the candidate information in the dynamic matrix. For the eighth candidate information list n8 ═ {2, 2, 3, 4, 6}, the values in the information list represent amounts of money, the unit cell, "2" is ordered first, corresponding to row 0 in the dynamic programming matrix. "2" is ordered second, corresponding to row 1 in the dynamic programming matrix. "3" is ordered to the third, corresponding to row 2 in the dynamic programming matrix. "4" is ordered fourth, corresponding to row 3 in the dynamic programming matrix. "6" is ordered as the fifth, corresponding to row 4 in the dynamic programming matrix. "4" is the previous of "6".
And for each candidate information in the eighth candidate information list, updating the state in the dynamic programming matrix corresponding to the candidate information based on the state of the candidate information in the dynamic programming matrix corresponding to the previous candidate information in the eighth candidate information list, and obtaining the updated dynamic programming matrix.
In some embodiments, the performing step determines the solving process of the first number of stages, which corresponds to the first number of candidate information included in the eighth candidate information list. The processing of each candidate is considered a processing stage. For each stage, a decision is made as to whether a candidate message is placed in the target message list. After each candidate message is decided, the eighth candidate message list may reach a plurality of different states. The set of states for the next stage is then derived based on the set of states for the previous stage. By combining the repeated states in each stage, the number of different states in each stage is ensured not to exceed the number of the payment information. Specifically, for the eighth candidate information list n8 ═ {2, 2, 3, 4, 6}, the numerical values in the information list represent the amount of money, unit dollars. Wherein, the eighth candidate information list includes 5 candidate information, and the first number is 5. The payment information "a ═ 9, and the value 9 indicates the amount of money, unit dollars". The number of different states in each stage will not exceed 9.
A two-dimensional array states [ n ] [ a +1] is defined to record different states that each element in the dynamic programming matrix at each stage can reach. Wherein states represents the dynamic programming matrix, n represents the number of candidate information in the eighth candidate information list, and a represents the numerical amount of the payment information.
For each candidate information in the eighth candidate information list, performing the following step seven, and updating the dynamic programming matrix:
step seven: and determining the serial number i of the candidate information in the eighth candidate information list, and determining the value j of the candidate information.
And in response to the candidate information being the first candidate information in the eighth candidate information list, setting the element value of the ith row and the 0 th column in the dynamic programming matrix to 1, and setting the element value of the ith row and the jth column in the dynamic programming matrix to 1. Specifically, for the eighth candidate information list n8 ═ {2, 2, 3, 4, 6}, the numerical values in the information list represent the amount of money, unit dollars. Wherein, the eighth candidate information list includes 5 candidate information, and the first number is 5. The payment information "a ═ 9, and the value 9 indicates the amount of money, unit dollars". The value of the 0 th (subscript numbered from 0) candidate is "2", and after the decision is completed, the result corresponds to two states of the decision, wherein the combination is "0" or "2". The two states are denoted by states [0] [0] true and states [0] [2] true. After the decision of the first candidate information is finished, the dynamic programming matrix is updated as follows:
after the 0 th coupon decision
And in response to the information not being the first candidate information in the eighth candidate information list, setting the value of the relevant element of the ith row in the dynamic programming matrix to 1 based on the state of the candidate information in the dynamic programming matrix corresponding to the previous candidate information in the eighth candidate information list. Specifically, the 1 st candidate information is "2", and after the candidate information is decided, there are 3 different states, specifically, states [1] [0] ═ true, states [1] [2] ═ true, and states [1] [4] ═ true, based on the previous combination state.
And executing the seventh step until all candidate information is decided, and finishing the calculation of the whole states state array. The following matrix can be seen in particular:
after the 1 st coupon decision
After the 2 nd coupon decision
After the 3 rd ticket is decided
After the 4 th coupon decision
Wherein, 0-9(a) represents the state value which can be reached after each coupon decision is finished, 0 represents false and 1 represents true in the table. And the 4 th ticket decision matrix is an updated dynamic programming matrix.
And generating a target information list based on the updated dynamic programming matrix. And searching for an element with the value of 1 and a value closest to the payment information a in the last row of the updated dynamic programming matrix. Specifically, the payment information "a" is 9, and the value 9 indicates the amount of money, unit. For all the elements "1", "0", "1" in the last row, the closest payment information "a is 9, the value 9 represents the amount of money, and the sum of all the values of the unit cell" is 9. According to the value of "9", searching is performed in the information in the eighth candidate information list corresponding to the element with the value of "1" in the last row. The information "6, value 6 indicates amount, unit cell" is found. Then, the information "3" is determined based on the difference between the values "9" and "6", and the value 6 indicates the amount of money, unit cell ". Information "6, value 6 represents amount, unit" and information "3, value 6 represents amount, unit" is determined as information in the target information list, and the target information list is n2 ═ 6, 3}, and the value in the information list represents amount, unit.
Fig. 5 shows an embodiment with the following advantages: for the electronic equipment which is not the terminal of the preset type, the operation mode is determined as the first mode. Firstly, a first candidate information list is sorted according to the numerical value and the expiration time, and a target information list is calculated by using a dynamic programming method. The method can preferentially recommend the information with large face value and quick expiration, meets the use requirements of the user, and provides an effective basis for the user to finally select the information.
Referring now to FIG. 6, shown is a block diagram of a computer system 600 suitable for use in implementing the electronic devices of embodiments of the present disclosure. The electronic device shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 6, the computer system 600 includes a Central Processing Unit (CPU)601, which can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 602 or a program loaded from a storage section 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data necessary for the operation of the system 600 are also stored. The CPU 601, ROM 602, and RAM 603 are connected to each other via a bus 604. An Input/Output (I/O) interface 605 is also connected to bus 604.
The following components are connected to the I/O interface 605: a storage portion 606 including a hard disk and the like; and a communication section 607 including a Network interface card such as a LAN (Local Area Network) card, a modem, or the like. The communication section 607 performs communication processing via a network such as the internet. Drivers 608 are also connected to the I/O interface 605 as needed. A removable medium 609 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 608 as necessary, so that a computer program read out therefrom is mounted into the storage section 606 as necessary.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 607 and/or installed from the removable medium 609. The above-described functions defined in the method of the present disclosure are performed when the computer program is executed by a Central Processing Unit (CPU) 601. It should be noted that the computer readable medium in the present disclosure may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer 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 of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, 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. In the present disclosure, a computer 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. In contrast, in the present disclosure, a computer-readable signal medium may include a propagated data signal with computer-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 computer readable signal medium may also be any computer readable medium that is not a computer 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 computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + +, 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 computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention in the present disclosure is not limited to the specific combination of the above-mentioned features, but also encompasses other embodiments in which any combination of the above-mentioned features or their equivalents is possible without departing from the inventive concept as defined above. For example, the above features and (but not limited to) the features disclosed in this disclosure having similar functions are replaced with each other to form the technical solution.
Claims (10)
1. An information display method comprising:
acquiring equipment information of electronic equipment for generating a target information list;
determining whether the electronic device is a predetermined type terminal based on device information of the electronic device;
in response to determining that the electronic device is not a predetermined type of terminal, performing a first mode-dependent processing step of:
setting an operation mode of the electronic equipment to be a first mode;
receiving payment information and a first candidate information list sent by a user terminal, wherein the first candidate information list comprises a first number of candidate information;
generating a second candidate information list based on a dynamic programming algorithm, the payment information and the first candidate information list;
carrying out numerical sorting on the second candidate information list to generate a third candidate information list;
and performing time sequencing on the third candidate information list, generating a target information list and displaying the target information list.
2. The method of claim 1, wherein the method further comprises:
in response to determining that the electronic device is a predetermined type of terminal, performing a second mode-dependent processing step of:
setting the operation mode of the electronic equipment to be a second mode;
receiving payment information sent by a user terminal and the first candidate information list;
generating a fourth candidate information list based on the dynamic programming algorithm, the payment information, and the first candidate information list;
determining the fourth candidate information list as the target information list in response to a sum of values included in candidate information in the fourth candidate information list being equal to the payment information;
in response to the fact that the sum of numerical values included in the candidate information in the fourth candidate information list is smaller than the payment information, conducting numerical value sorting on the fourth candidate information list to generate a fifth candidate information list, conducting time sorting on the fifth candidate information list to generate a first target information list;
generating second payment information in response to the sum of the values of the candidate information in the fourth candidate information list being larger than the payment information, generating a second target information list based on the second payment information, and determining the first target information list and the second target information list as the target information list.
3. The method of claim 2, wherein the method further comprises:
and responding to the fact that the target information list contains the first number of information, sending the target information list to equipment supporting prompt, and controlling the equipment to send out prompt information.
4. The method of claim 2, wherein the generating a second list of target information based on the second payment information comprises:
generating a sixth candidate information list based on the dynamic programming algorithm, the second payment information, and the first candidate information list;
carrying out numerical sorting on the sixth candidate information list to generate a seventh candidate information list;
and performing time sequencing on the seventh candidate information list to generate the second target information list.
5. The method of claim 2, wherein the generating a second candidate list of information based on the dynamic programming algorithm, the payment information, and the first candidate list of information comprises:
generating a dynamic planning matrix based on the payment information and the first candidate information list, wherein the dynamic planning matrix is a zero matrix;
for each candidate information in the first candidate information list, updating the state in the dynamic programming matrix corresponding to the candidate information based on the state of the candidate information in the dynamic programming matrix corresponding to the previous candidate information in the first candidate information list, and generating an updated dynamic programming matrix;
and generating the second candidate information list based on the updated dynamic programming matrix.
6. The method of claim 5, wherein the dynamic programming matrix comprises a first number of rows;
the dynamic programming matrix includes a numerical number of columns of the payment information.
7. The method of claim 6, wherein for each candidate information in the first candidate information list, updating the state of the dynamic programming matrix corresponding to the candidate information based on the state of the candidate information in the dynamic programming matrix corresponding to the previous candidate information in the first candidate information list, and generating an updated dynamic programming matrix, comprises:
determining the serial number i of the candidate information in the first candidate information list;
determining a value j of the candidate information;
in response to the candidate information being the first candidate information in the first candidate information list, setting the element value of the ith row and the 0 th column in the dynamic programming matrix to 1, and setting the element value of the ith row and the jth column in the dynamic programming matrix to 1;
and in response to the candidate information not being the first candidate information in the first candidate information list, setting the value of the relevant element in the ith row in the dynamic programming matrix to be 1 based on the state of the candidate information in the dynamic programming matrix corresponding to the previous candidate information in the first candidate information list.
8. The method of claim 7, wherein the generating the second list of candidate information based on the updated dynamic programming matrix comprises:
finding an r-th row corresponding to the maximum combined amount from the updated dynamic programming matrix, wherein the combined amount is the sum of the element values of each row in the dynamic programming matrix;
and determining the candidate information in the first candidate information list corresponding to the element with the value of 1 in the r-th row as the candidate information in the second candidate information list.
9. The method of claim 8, wherein the numerically sorting the second candidate list of information to generate a third candidate list of information comprises:
and reordering all candidate information in the second candidate information list according to the order of the numerical values from small to large to generate a third candidate information list.
10. The method of claim 9, wherein said time-ordering the third candidate list of information to generate a target list of information comprises:
reordering all candidate information in the third candidate information list according to the order of expiration time from large to small to obtain an eighth candidate information list;
for each candidate information in the third candidate information list, in response to the existence of at least two candidate information with the same value as the candidate information in the second candidate information list, finding the target candidate information with the minimum expiration time by using a binary algorithm;
in response to the target candidate information not being the corresponding candidate information of the same value in the eighth candidate information list, replacing the target candidate information with the corresponding candidate information of the same value in the eighth candidate information list;
outputting the eighth candidate information list as the target information list.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010478695.XA CN113742568A (en) | 2020-05-29 | 2020-05-29 | Information display method, electronic device, and computer-readable medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010478695.XA CN113742568A (en) | 2020-05-29 | 2020-05-29 | Information display method, electronic device, and computer-readable medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113742568A true CN113742568A (en) | 2021-12-03 |
Family
ID=78724976
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010478695.XA Pending CN113742568A (en) | 2020-05-29 | 2020-05-29 | Information display method, electronic device, and computer-readable medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113742568A (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070179967A1 (en) * | 2005-11-22 | 2007-08-02 | Zhang Xiaoge G | Intuitive and Dynamic File Retrieval Method and User Interface System |
| US20090192913A1 (en) * | 2008-01-29 | 2009-07-30 | International Business Machines Corporation | Electronic payment system |
| CN104025135A (en) * | 2011-12-28 | 2014-09-03 | 乐天株式会社 | Electronic-ticket update device, electronic-ticket update method, electronic-ticket update program, and computer-readable recording medium containing said program |
| KR20150053299A (en) * | 2013-11-07 | 2015-05-18 | 에스케이플래닛 주식회사 | System, Service Apparatus and Method for Providing Electronic Coupon using Customer Card |
| KR20150096573A (en) * | 2014-02-14 | 2015-08-25 | 에스케이플래닛 주식회사 | Apparatus and method for displaying coupon in connection with coupon usage information |
| US9201952B1 (en) * | 2010-12-21 | 2015-12-01 | Google Inc. | User interface for activity status and history |
| CN107180371A (en) * | 2016-03-11 | 2017-09-19 | 北京京东尚科信息技术有限公司 | The method and system of commodity is bought using reward voucher |
| CN109688134A (en) * | 2018-12-26 | 2019-04-26 | 多点生活(成都)科技有限公司 | Method for exhibiting data and device |
| CN110335088A (en) * | 2019-07-10 | 2019-10-15 | 中国工商银行股份有限公司 | Information processing method and its device, electronic equipment and medium |
| CN110866771A (en) * | 2018-08-28 | 2020-03-06 | 北京京东尚科信息技术有限公司 | Information processing method, system, medium, and computer system |
-
2020
- 2020-05-29 CN CN202010478695.XA patent/CN113742568A/en active Pending
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070179967A1 (en) * | 2005-11-22 | 2007-08-02 | Zhang Xiaoge G | Intuitive and Dynamic File Retrieval Method and User Interface System |
| US20090192913A1 (en) * | 2008-01-29 | 2009-07-30 | International Business Machines Corporation | Electronic payment system |
| US9201952B1 (en) * | 2010-12-21 | 2015-12-01 | Google Inc. | User interface for activity status and history |
| CN104025135A (en) * | 2011-12-28 | 2014-09-03 | 乐天株式会社 | Electronic-ticket update device, electronic-ticket update method, electronic-ticket update program, and computer-readable recording medium containing said program |
| KR20150053299A (en) * | 2013-11-07 | 2015-05-18 | 에스케이플래닛 주식회사 | System, Service Apparatus and Method for Providing Electronic Coupon using Customer Card |
| KR20150096573A (en) * | 2014-02-14 | 2015-08-25 | 에스케이플래닛 주식회사 | Apparatus and method for displaying coupon in connection with coupon usage information |
| CN107180371A (en) * | 2016-03-11 | 2017-09-19 | 北京京东尚科信息技术有限公司 | The method and system of commodity is bought using reward voucher |
| CN110866771A (en) * | 2018-08-28 | 2020-03-06 | 北京京东尚科信息技术有限公司 | Information processing method, system, medium, and computer system |
| CN109688134A (en) * | 2018-12-26 | 2019-04-26 | 多点生活(成都)科技有限公司 | Method for exhibiting data and device |
| CN110335088A (en) * | 2019-07-10 | 2019-10-15 | 中国工商银行股份有限公司 | Information processing method and its device, electronic equipment and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106980955B (en) | Method and apparatus for outputting information | |
| US11325780B2 (en) | Method and device for sorting cargo | |
| CN106875148B (en) | Method and device for determining a storage position for an item | |
| CN101860449B (en) | Data query method, device and system | |
| JP2020533254A (en) | Methods and equipment for sorting cargo | |
| CN107944481B (en) | Method and apparatus for generating information | |
| CN107506495B (en) | Information pushing method and device | |
| US20210201251A1 (en) | Information output method and apparatus | |
| CN112184348B (en) | Order data processing method, device, electronic equipment and medium | |
| CN110555451A (en) | information identification method and device | |
| CN111177433B (en) | Method and apparatus for parallel processing of information | |
| CN103514207A (en) | Method and device for pushing service objects | |
| CN109345166B (en) | Method and apparatus for generating information | |
| CN112765230A (en) | Payment big data analysis method and big data analysis system based on internet finance | |
| CN112860993A (en) | Method, device, equipment, storage medium and program product for classifying points of interest | |
| CN113793081A (en) | Storage monitoring method and device, computer readable medium and electronic equipment | |
| CN109255563B (en) | Method and device for determining storage area of article | |
| CN107977876B (en) | Method and device for processing order information | |
| CN112445873A (en) | List display processing method, related device, equipment and medium | |
| CN112308477A (en) | Inventory positioning method and device | |
| CN113742568A (en) | Information display method, electronic device, and computer-readable medium | |
| CN112348300A (en) | Method and device for pushing information | |
| EP3864525B1 (en) | System, method, and computer program product for load balancing to process large data sets | |
| CN111339432A (en) | Recommendation method and device of electronic object and electronic equipment | |
| CN112906723A (en) | Feature selection method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |