注册一亩三分地论坛,查看更多干货!
您需要 登录 才可以下载或查看附件。没有帐号?注册账号 
x
一道coding,一道database,求加米
Coding:
Given an array of n positive integers, assuming 0-based indexing, its cost is sum(arr[i] - arr[i-1])^2 from i = 1 to len(arr) - 1..--
len(arr) is and 7, cost = 5.
Output: min(solutions) = 5
.
Database - SQL:
两张表,用一个key进行join,然后filter和排序 |