CN110992011A

CN110992011A - Data splitting method and device, electronic equipment and storage medium

Info

Publication number: CN110992011A
Application number: CN201911241157.2A
Authority: CN
Inventors: 袁玮鸿
Original assignee: Shenzhen Lexin Software Technology Co Ltd
Current assignee: Shenzhen Lexin Software Technology Co Ltd
Priority date: 2019-12-06
Filing date: 2019-12-06
Publication date: 2020-04-10

Abstract

The embodiment of the disclosure discloses a data splitting method, a data splitting device, an electronic device and a storage medium, wherein the method comprises the following steps: grouping a plurality of due repayment lists of the target users according to the funding parties; any group is regrouped according to a set threshold value, bills with the money amount larger than or equal to the set threshold value are distributed to a recharging sub-group, and due repayment bills with the money amount smaller than the set threshold value are distributed to a payment sub-group; and regrouping the due repayment bills in the payment sub-group according to the set threshold value. The technical scheme of the embodiment considers the limit problem of the user in payment, reduces the payment times of the user as much as possible, can reduce user operation, and can improve the payment efficiency of the user.

Description

Data splitting method and device, electronic equipment and storage medium

Technical Field

The embodiment of the disclosure relates to the technical field of internet finance, in particular to a data splitting method, a data splitting device, electronic equipment and a storage medium.

Background

In the e-commerce field, staging business is becoming a payment trend with an increasing occupancy, and some internet companies are spreading to people at a specific age stage by using the same as a selling point. There are diversified ways for staging business in response to compliance requirements.

Regarding the business form of payment, if the number and total amount of the installment items of the user are large, the current single form payment method may face the problem that the bank limit causes the payment difficulty during the payment, and if the payment is carried out one by one, the payment is too frequent.

Disclosure of Invention

In view of this, the embodiments of the present disclosure provide a data splitting method, an apparatus, an electronic device, and a storage medium, so as to improve the payment efficiency of a user. .

Additional features and advantages of the disclosed embodiments 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 disclosed embodiments.

In a first aspect, an embodiment of the present disclosure provides a data splitting method, including:

grouping a plurality of due repayment lists of the target users according to the funding parties;

any group is regrouped according to a set threshold value, bills with the money amount larger than or equal to the set threshold value are distributed to a recharging sub-group, and due repayment bills with the money amount smaller than the set threshold value are distributed to a payment sub-group;

and regrouping the due repayment bills in the payment sub-group according to the set threshold value.

In an embodiment, the regrouping the expired payment tickets in the payment sub-group according to the set threshold includes:

and regrouping the expired repayment bills in the payment sub-group into groups with the total sum less than or equal to the set threshold value by adopting a greedy algorithm.

In an embodiment, before regrouping into groups with total amount less than or equal to the set threshold by using greedy algorithm, the method further includes sorting the expired repayment tickets in the payment sub-group according to the amount from large to small.

In one embodiment, the method further comprises, after allocating the bill with the amount greater than or equal to the set threshold to the recharge sub-packet:

and calculating the total amount of the due repayment bill in the recharging sub-group, and re-splitting the total amount according to the set threshold value.

In one embodiment, the method further comprises determining the set threshold based on credit information and historical debit information of the target user before regrouping any of the groups according to the set threshold.

In a second aspect, an embodiment of the present disclosure further provides a data splitting apparatus, including:

the first grouping unit is used for grouping the multiple due repayment lists of the target user according to the funding party to which the multiple due repayment lists belong;

the second grouping unit is used for regrouping any one group according to a set threshold value, distributing bills with the money amount larger than or equal to the set threshold value to the recharging sub-group, and distributing due repayment bills with the money amount smaller than the set threshold value to the payment sub-group;

and the third grouping unit is used for carrying out grouping again on the due repayment lists in the payment sub-groups according to the set threshold value.

In one embodiment, the third grouping unit is configured to:

In an embodiment, the third grouping unit is further configured to sort the due repayment tickets in the payment sub-grouping according to the money amounts from large to small before regrouping into the grouping with the total money amount smaller than or equal to the set threshold value by using a greedy algorithm.

In one embodiment, the apparatus further includes a fourth grouping unit, configured to, after allocating the bill with the amount greater than or equal to the set threshold value to the recharge sub-group: and calculating the total amount of the due repayment bill in the recharging sub-group, and re-splitting the total amount according to the set threshold value.

In one embodiment, the second packet unit is further configured to: and before any group is regrouped according to a set threshold, determining the set threshold according to the credit information and the historical loan information of the target user.

In a third aspect, an embodiment of the present disclosure further provides an electronic device, including:

one or more processors;

a memory for storing one or more programs;

when executed by the one or more processors, cause the one or more processors to implement the instructions of the method of any one of the first aspects.

In a fourth aspect, the disclosed embodiments also provide a computer-readable storage medium, on which a computer program is stored, which when executed by a processor implements the steps of the method according to any one of the first aspect.

The method comprises the steps that a plurality of due repayment lists of a target user are grouped according to the funding party to which the target user belongs; and any group is regrouped into a recharging sub-group and a payment sub-group according to a set threshold value, and the repayment bills due to expiration in the payment sub-group are regrouped according to the set threshold value. The technical scheme of this embodiment can avoid causing the problem of inconvenient payment because of the user payment card exceeds the threshold restriction to can avoid the user because of the too big problem that causes the payment number of times of bill quantity, can reduce user operation, can improve user payment efficiency.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present disclosure, the drawings needed to be used in the description of the embodiments of the present disclosure will be briefly described below, and it is obvious that the drawings in the following description are only a part of the embodiments of the present disclosure, and for those skilled in the art, other drawings can be obtained according to the contents of the embodiments of the present disclosure and the drawings without creative efforts.

Fig. 1 is a schematic flow chart diagram of a data splitting method provided by an embodiment of the present disclosure;

fig. 2 is a schematic flow chart diagram of another data splitting method provided by an embodiment of the present disclosure;

fig. 3 is an example flowchart of a data splitting method provided by an embodiment of the present disclosure;

fig. 4 is a schematic structural diagram of a data splitting apparatus provided in an embodiment of the present disclosure;

FIG. 5 is a schematic structural diagram of another data splitting apparatus provided in the embodiments of the present disclosure;

FIG. 6 shows a schematic structural diagram of an electronic device suitable for use in implementing embodiments of the present disclosure.

Detailed Description

In order to make the technical problems solved, technical solutions adopted and technical effects achieved by the embodiments of the present disclosure clearer, the technical solutions of the embodiments of the present disclosure will be described in further detail below with reference to the accompanying drawings, and it is obvious that the described embodiments are only some embodiments, but not all embodiments, of the embodiments of the present disclosure. All other embodiments, which can be obtained by a person skilled in the art without making creative efforts based on the embodiments of the present disclosure, belong to the protection scope of the embodiments of the present disclosure.

It should be noted that the terms "system" and "network" are often used interchangeably in the embodiments of the present disclosure. Reference to "and/or" in embodiments of the present disclosure is meant to include any and all combinations of one or more of the associated listed items. The terms "first", "second", and the like in the description and claims of the present disclosure and in the drawings are used for distinguishing between different objects and not for limiting a particular order.

It should also be noted that, in the embodiments of the present disclosure, each of the following embodiments may be executed alone, or may be executed in combination with each other, and the embodiments of the present disclosure are not limited specifically.

The names of messages or information exchanged between devices in the embodiments of the present disclosure are for illustrative purposes only, and are not intended to limit the scope of the messages or information.

The technical solutions of the embodiments of the present disclosure are further described by the following detailed description in conjunction with the accompanying drawings.

Fig. 1 shows a flowchart of a data splitting method provided in an embodiment of the present disclosure, where this embodiment is applicable to a case where multiple due payment tickets of a target user are split into multiple groups, and the method may be executed by a data splitting apparatus configured in an electronic device, as shown in fig. 1, the data splitting method according to this embodiment includes:

in step S110, a plurality of due payment tickets of the target user are grouped according to the funding party.

In step S120, any one of the groups is regrouped according to a set threshold, the bills with the amount greater than or equal to the set threshold are allocated to the recharge sub-group, and the due repayment bills with the amount less than the set threshold are allocated to the payment sub-group.

In step S130, regrouping the due payment tickets in the payment sub-group according to the set threshold.

For example, the payment slips in the payment sub-group can be regrouped into groups with the total sum less than or equal to the set threshold value by adopting a greedy algorithm.

In an embodiment, before regrouping into groups with total sum less than or equal to the set threshold value by using greedy algorithm, sorting the due repayment bills in the payment sub-groups according to the sum from large to small, and regrouping into groups with total sum less than or equal to the set threshold value by using greedy algorithm according to the sorting result.

The technical scheme of the embodiment groups a plurality of due repayment lists of a target user according to the funding party to which the target user belongs; and any group is regrouped into a recharging sub-group and a payment sub-group according to a set threshold value, and the repayment bills due to expiration in the payment sub-group are regrouped according to the set threshold value. The technical scheme of this embodiment can avoid causing the problem of inconvenient payment because of the user payment card exceeds the threshold restriction to can avoid the user because of the too big problem that causes the payment number of times of bill quantity, can reduce user operation, can improve user payment efficiency.

Fig. 2 shows a schematic flow chart of another data splitting method provided in the embodiment of the present disclosure, and the embodiment is based on the foregoing embodiment and is subjected to improved optimization. As shown in fig. 2, the data splitting method according to this embodiment includes:

in step S210, a plurality of due payment tickets of the target user are grouped according to the funding party to which the payment tickets belong.

Fig. 3 is an exemplary flowchart of a data splitting method provided by an embodiment of the present disclosure, for example, as shown in fig. 3, a bill repayment list of a user relates to three funding parties (the liquidation party shown in fig. 3): a clearing and grading prescription 1, a clearing and grading prescription 2 and a clearing and grading prescription 3. The multiple expired repayment single accounts contained in the bill repayment list are divided into three groups according to the funding party.

In step S220, any group is regrouped according to a set threshold, the bills with the amount greater than or equal to the set threshold are allocated to the recharge sub-group, and the due repayment bills with the amount less than the set threshold are allocated to the payment sub-group.

For example, the expired payment bills in each group obtained in step S210 may be traversed, the set threshold may be a bank payment limit, for example, if the payment per day cannot exceed 1 ten thousand, the expired payment bills in the group greater than or equal to 1 ten thousand are grouped into a recharge sub-group, and the expired payment bills in the group less than 1 ten thousand are grouped into a payment group.

In step S230, the due repayment orders in the payment sub-group are sorted from large to small according to the amount, and are regrouped into groups with the total amount less than or equal to the set threshold value by using a greedy algorithm.

For example, pay packets are ordered by data from large to small N (0), N (1), N (2)

And traversing one by one, adding the payment orders adjacently, and taking the payment orders before adding as a payment group if the sum of the payment orders after adding one expiration payment order is larger than a threshold value. The remaining expired payment orders perform this operation in turn until finally they can all be grouped together.

In the above, the algorithm has a time complexity of O (nlog2n) to O (n), and a space complexity of O (1). The complexity is low, and the algorithm performance is extremely superior.

In step S240, the total amount of the expired payment tickets in the recharging sub-packet is calculated, and the total amount is re-split according to the set threshold.

And accumulating the recharging sub-groups and dividing the recharging sub-groups according to the number to obtain recharging groups. For example, if the sum is 3.3W and the threshold is set to 1 ten thousand, the values can be divided into 4 groups of 1W, 1W and 0.3W. For example, if the sum is 2.7W and the threshold is set to 1 ten thousand, the data can be divided into 3 groups of 1W, 1W and 0.7W.

On the basis of the previous embodiment, the embodiment further discloses a technical scheme that due repayment lists in the payment sub-groups are sorted from large to small according to the amount of money, and the repayment lists are grouped into groups with the total amount of money smaller than or equal to the set threshold value by adopting a greedy algorithm, so that the complexity can be reduced, the calculation efficiency can be improved, and the data splitting time delay can be reduced.

As implementations of the methods shown in the above drawings, the present application provides an embodiment of a data splitting apparatus, and fig. 4 illustrates a schematic structural diagram of the data splitting apparatus provided in this embodiment, where the embodiment of the apparatus corresponds to the method embodiments shown in fig. 1 to fig. 3, and the apparatus may be specifically applied to various electronic devices. As shown in fig. 4, the data splitting apparatus according to this embodiment includes a first packet unit 410, a second packet unit 420, and a third packet unit 430.

The first grouping unit 410 is configured to group a plurality of expired payment tickets of the target user according to the funding party.

The second grouping unit 420 is configured to regroup any one of the groups according to a set threshold, allocate bills having an amount greater than or equal to the set threshold to the recharge sub-group, and allocate due repayment tickets having an amount less than the set threshold to the payment sub-group.

The third grouping unit 430 is configured to regroup the expired payment bills in the payment sub-group according to the set threshold.

In an embodiment, the third grouping unit 430 is configured to adopt a greedy algorithm to regroup the expired payment bills in the payment sub-group into groups with a total amount less than or equal to the set threshold.

Further, the third grouping unit 430 is configured to further sort the expired repayment orders in the payment sub-groups according to the money amounts from large to small before regrouping into the groups with the total money amount less than or equal to the set threshold value by adopting a greedy algorithm.

Further, the second grouping unit 420 is configured to determine the set threshold value according to the credit information and the historical debit information of the target user before any grouping is performed according to the set threshold value.

The data splitting device provided by the embodiment can execute the data splitting method provided by the embodiment of the method disclosed by the invention, and has corresponding functional modules and beneficial effects of the execution method.

Fig. 5 shows a schematic structural diagram of another data splitting device provided in the embodiment of the present disclosure, and as shown in fig. 5, the data splitting device described in this embodiment includes a first packet unit 510, a second packet unit 520, a third packet unit 530, and a fourth packet unit 540.

The first grouping unit 510 is configured to group a plurality of expired payment tickets of the target user according to the funding party.

The second grouping unit 520 is configured to determine the set threshold according to the credit information and the historical debit and credit information of the target user, regroup any group according to the set threshold, allocate bills with the amount greater than or equal to the set threshold to the recharge sub-group, and allocate due repayment bills with the amount less than the set threshold to the payment sub-group.

The third grouping unit 530 is configured to regroup the expired payment bills in the payment sub-group according to the set threshold.

The fourth grouping unit 540 is configured to calculate a total amount of the expired payment tickets in the recharging sub-group, and re-split the total amount according to the set threshold.

In an embodiment, the third grouping unit 530 is configured to adopt a greedy algorithm to regroup the expired payment bills in the payment sub-group into groups with total amount less than or equal to the set threshold.

Further, the third grouping unit 530 is configured to further sort the expired repayment orders in the payment sub-groups according to the money amounts from large to small before regrouping into the groups with the total money amount less than or equal to the set threshold value by adopting a greedy algorithm.

Referring now to FIG. 6, a block diagram of an electronic device 600 suitable for use in implementing embodiments of the present disclosure is shown. The terminal device in the embodiments of the present disclosure may include, but is not limited to, a mobile terminal such as a mobile phone, a notebook computer, a digital broadcast receiver, a PDA (personal digital assistant), a PAD (tablet computer), a PMP (portable multimedia player), a vehicle terminal (e.g., a car navigation terminal), and the like, and a stationary terminal such as a digital TV, a desktop computer, and the like. 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, electronic device 600 may include a processing means (e.g., central processing unit, graphics processor, etc.) 601 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage means 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data necessary for the operation of the electronic apparatus 600 are also stored. The processing device 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.

Generally, the following devices may be connected to the I/O interface 605: input devices 606 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 607 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 608 including, for example, tape, hard disk, etc.; and a communication device 609. The communication means 609 may allow the electronic device 600 to communicate with other devices wirelessly or by wire to exchange data. While fig. 6 illustrates an electronic device 600 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided.

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 by the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication means 609, or may be installed from the storage means 608, or may be installed from the ROM 602. The computer program, when executed by the processing device 601, performs the above-described functions defined in the methods of the embodiments of the present disclosure.

It should be noted that the computer readable medium described above in the embodiments of 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 disclosed embodiments, 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 disclosed embodiments, a computer readable signal medium may comprise 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: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.

The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled into the electronic device.

The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to:

Computer program code for carrying out operations for embodiments 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 units described in the embodiments of the present disclosure may be implemented by software or hardware. Where the name of a unit does not in some cases constitute a limitation of the unit itself, for example, the first retrieving unit may also be described as a "unit for retrieving at least two internet protocol addresses".

The foregoing description is only a preferred embodiment of the disclosed embodiments 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 disclosure in the embodiments of the present disclosure is not limited to the particular combination of the above-described features, but also encompasses other embodiments in which any combination of the above-described features or their equivalents is possible without departing from the scope of the present disclosure. For example, the above features and (but not limited to) the features with similar functions disclosed in the embodiments of the present disclosure are mutually replaced to form the technical solution.

Claims

1. A data splitting method is characterized by comprising the following steps:

2. The method of claim 1, wherein regrouping the expired payment tickets within the payment subgroup according to the set threshold comprises:

3. The method of claim 2, further comprising, prior to regrouping into groups having a total amount less than or equal to the set threshold using a greedy algorithm, sorting the payouts due within the payment sub-group by amount from large to small.

4. The method of claim 1, further comprising, after allocating a bill having an amount greater than or equal to a set threshold to a top-up sub-group:

5. The method of claim 1, further comprising determining the set threshold based on credit information and historical debit information of the target subscriber prior to regrouping any of the groups according to the set threshold.

6. A data splitting apparatus, comprising:

7. An electronic device, comprising:

one or more processors;

a memory for storing one or more programs;

instructions which, when executed by the one or more processors, cause the one or more processors to carry out the method of any one of claims 1-5.

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