IP屬地：重慶
-
[算法設(shè)計(jì)與分析-期末項(xiàng)目] Capacitated Facility Location Problem
題目描述 Suppose there are n facilities and m customers. We wishto choose:? ...
-
[2018-12-23] [LeetCode-Week16] 516. Longest Palindromic Subsequence 動(dòng)態(tài)規(guī)劃https://leetcode.com/problems/longest-palindromic-subsequence/ Given a s...
-
[2018-12-16] [LeetCode-Week15] 338. Counting Bits 遞推
https://leetcode.com/problems/counting-bits/ Given a non negative intege...
-
[2018-12-09] [LeetCode-Week14] 647. Palindromic Substrings 動(dòng)態(tài)規(guī)劃
https://leetcode.com/problems/palindromic-substrings/ Given a string, yo...
-
[2018-12-02] [LeetCode-Week13] 198. House Robber 動(dòng)態(tài)規(guī)劃
https://leetcode.com/problems/house-robber/ You are a professional robbe...
-
[2018-11-25] [LeetCode-Week12] 53. Maximum Subarray 動(dòng)態(tài)規(guī)劃
https://leetcode.com/problems/maximum-subarray/ Given an integer array n...
-
[2018-11-18] [LeetCode-Week11] 121. Best Time to Buy and Sell Stock 動(dòng)態(tài)規(guī)劃
https://leetcode.com/problems/best-time-to-buy-and-sell-stock/ Say you h...
-
[2018-11-11] [LeetCode-Week10] 709. To Lower Case 字符串
https://leetcode.com/problems/to-lower-case/description/ -- Implement fu...
-
[2018-11-04] [LeetCode-Week9] 931. Minimum Falling Path Sum 動(dòng)態(tài)規(guī)劃
https://leetcode.com/problems/minimum-falling-path-sum/description/ Give...