注册一亩三分地论坛,查看更多干货!
您需要 登录 才可以下载或查看附件。没有帐号?注册账号 
x
1. Given an array, divide it into two subset A and B where subsets don't intersect with each other and union of the two is the original array. Find the minimal A such are both programmic. Example: "pprrogrammabceerprogrammer" => 1 (index 15 meets the requirement)
|