Natural Greedy. Sort the array and pick the medium as target. classSolution {public:intminMoves2(vector<int>&nums) {intn =nums.size();if(n ==1)return0; sort(nums.begin(), nums.end());intmid = nums[n/2];intret =0;for(auto v : nums) ret += abs(v -mid);returnret; } };...
LintCode "Minimum Adjustment Cost" 67 3 2D DP. DP is all about choices - current choice with previous choice :) A natural solution as below, and of course we can simply use rolling array for better memory utilization. classSolution {constintMaxNum =101;public:/** * @param A: An integ...