摘要:
原题链接在这里:https://leetcode.com/problems/most-profit-assigning-work/ 题目: We have jobs: difficulty[i] is the difficulty of the ith job, and profit[i] is t 阅读全文
posted @ 2019-08-19 13:18
Dylan_Java_NYC
阅读(346)
评论(0)
推荐(0)
摘要:
原题链接在这里:https://leetcode.com/problems/3sum-with-multiplicity/ 题目: Given an integer array A, and an integer target, return the number of tuples i, j, k 阅读全文
posted @ 2019-08-19 12:41
Dylan_Java_NYC
阅读(235)
评论(0)
推荐(0)
浙公网安备 33010602011771号