摘要:
Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive. Example: Note: 阅读全文
摘要:
2017(10-12月) 码农类 博士 全职@Facebook - 猎头 - Onsite |Fail在职跳槽1. 1。 Laoyin. Validate BST. Regex matching。烙印给完题都举好多个例子,有拖延时间的嫌疑。regex那题本人做过但做不到秒杀,烙印非要我解释清楚再写c 阅读全文
摘要:
Given an unsorted array nums, reorder it in-place such that nums[0] <= nums[1] >= nums[2] <= nums[3].... For example, given nums = [3, 5, 2, 1, 6, 4], 阅读全文