joannae - 博客园

171. Excel Sheet Column Number (Math)

摘要： Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 阅读全文

posted @ 2017-04-07 03:00 joannae 阅读(141) 评论(0) 推荐(0) 编辑

168. Excel Sheet Column Title (Math)

摘要： Given a positive integer, return its corresponding column title as appear in an Excel sheet.For example: 1 -> A 2 -> B 3 -> C ... 26 -> Z 27 -> AA 28 阅读全文

posted @ 2017-04-07 02:59 joannae 阅读(141) 评论(0) 推荐(0) 编辑

166. Fraction to Recurring Decimal (Math)

摘要： Given two integers representing the numerator and denominator of a fraction, return the fraction in string format. If the fractional part is repeating 阅读全文

posted @ 2017-03-23 01:57 joannae 阅读(109) 评论(0) 推荐(0) 编辑

165. Compare Version Numbers (String)

摘要： Compare two version numbers version1 and version2. If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0. You may assu 阅读全文

posted @ 2017-03-22 21:51 joannae 阅读(113) 评论(0) 推荐(0) 编辑

164. Maximum Gap (Array; sort)

摘要： Given an unsorted array, find the maximum difference between the successive elements in its sorted form. Try to solve it in linear time/space. Return 阅读全文

posted @ 2017-03-20 23:55 joannae 阅读(90) 评论(0) 推荐(0) 编辑

162. Find Peak Element (Array; Divide-and-Conquer)

摘要： A peak element is an element that is greater than its neighbors. Given an input array where num[i] ≠ num[i+1], find a peak element and return its inde 阅读全文

posted @ 2017-03-20 21:40 joannae 阅读(124) 评论(0) 推荐(0) 编辑

160. Intersection of Two Linked Lists (List；Two-Pointers)

摘要： Write a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:A: a1 → a2 ↘ 阅读全文

posted @ 2017-03-20 21:01 joannae 阅读(107) 评论(0) 推荐(0) 编辑

155. Min Stack （stack)

摘要： Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack. pop() -- Remov 阅读全文

posted @ 2017-03-15 06:55 joannae 阅读(120) 评论(0) 推荐(0) 编辑

154. Find Minimum in Rotated Sorted Array II (Array; Divide-and-Conquer)

摘要： Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).Find th 阅读全文

posted @ 2017-01-17 01:09 joannae 阅读(186) 评论(0) 推荐(0) 编辑

153. Find Minimum in Rotated Sorted Array (Array; Divide-and-Conquer)