摘要:
Given two 32-bit numbers, N and M, and two bit positions, i and j. Write a method to set all bits between i and j in N equal to M (e g , M becomes a s 阅读全文
posted @ 2016-07-20 04:46
北叶青藤
阅读(228)
评论(0)
推荐(0)
摘要:
Given a directed graph, design an algorithm to find out whether there is a route between two nodes. Have you met this question in a real interview? Ye 阅读全文
posted @ 2016-07-20 04:16
北叶青藤
阅读(222)
评论(0)
推荐(0)
摘要:
Given an integer matrix, find a submatrix where the sum of numbers is zero. Your code should return the coordinate of the left-up and right-down numbe 阅读全文
posted @ 2016-07-20 04:04
北叶青藤
阅读(347)
评论(0)
推荐(0)

浙公网安备 33010602011771号