@Longji
hi can u pls explain why the return value start is exactly the sum of a subarray will it have a chance miss the value?
zhiqing
@zhiqing
Posts made by zhiqing

RE: Clear Explanation: 8ms Binary Search Java

my AC code is definitely wrong not sure why pass the OJ
below is my solution, the last loop to get the result is wrong, but it pass the OJ strange
public List<Integer> largestDivisibleSubset(int[] nums) {
if(nums.length==0) return new ArrayList<>();
Arrays.sort(nums);
int[] dp = new int[nums.length];
Arrays.fill(dp, 1);
List<Integer> res = new ArrayList<>();
int i=nums.length1;
while(i>=0)
{
for(int j=i1; j>=0; j)
{
if(nums[i]%nums[j]==0)
dp[j]=Math.max(dp[j], dp[i]+1);
}
i;
}for(int k=nums.length1; k>=0; k) { if(res.size()<dp[k]) res.add(0, nums[k]); } return res; }

RE: Straight Forward Java Solution Using Backtracking
@livelearn briefly look at your code, find u make the same mistake when i do the first trial,
think about that in the first two for loop, u detect the cell with '.' if the cell has no digit to fill it will remain as '.' then next time calling the same method it will detect this cell again that's the problem. hope this helps, since I'm not a python expert maybe my understanding is wrong 
RE: [IMPORTANT NOTICE] Cheating Announcement
@dqi2 i also wondering why cheating for $100 amazon gift card?

Why java code is the slowest for solving this problem
why java code is the slowest compare with other languages, even slower than c#, if it is true, why so many companies choosing java to develop applications.