摘要：
Problem: Implement pow(x, n). Subscribe to see which companies asked this question 考虑到指数为负的情况 利用二分来求结果 时间复杂度O(logn) 1 class Solution { 2 public: 3 dou 阅读全文
摘要：
Problem: Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. Subscribe to see which companie 阅读全文
摘要：
Prolem: Given an array where elements are sorted in ascending order, convert it to a height balanced BST. Subscribe to see which companies asked this 阅读全文
摘要：
Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. Subscribe to see which companies asked thi 阅读全文