2019年3月14日
740. Delete and Earn
摘要： Given an array nums of integers, you can perform operations on the array. In each operation, you pick any nums[i] and delete it to earn nums[i] points 阅读全文
posted @ 2019-03-14 22:13 Veritas_des_Liberty 阅读(225) 评论(0) 推荐(0)
712. Minimum ASCII Delete Sum for Two Strings
摘要： Given two strings s1, s2, find the lowest ASCII sum of deleted characters to make two strings equal. Example 1: Example 2: Note: 0 < s1.length, s2.len 阅读全文
posted @ 2019-03-14 20:53 Veritas_des_Liberty 阅读(251) 评论(0) 推荐(0)
698. Partition to K Equal Sum Subsets
摘要： Given an array of integers nums and a positive integer k, find whether it's possible to divide this array into k non-empty subsets whose sums are all 阅读全文
posted @ 2019-03-14 18:46 Veritas_des_Liberty 阅读(246) 评论(0) 推荐(0)