逸朵 - 博客园

2017年12月7日

摘要： Follow up for H-Index: What if the citations array is sorted in ascending order? Could you optimize your algorithm? 阅读全文

posted @ 2017-12-07 02:44 逸朵阅读(114) 评论(0) 推荐(0)

Leetcode 274: H-Index

摘要： Given an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher's h-index. According 阅读全文

posted @ 2017-12-07 02:40 逸朵阅读(157) 评论(0) 推荐(0)

Leetcode 273: Integer to English Words

摘要： Convert a non-negative integer to its english words representation. Given input is guaranteed to be less than 231 - 1. For example, 123 -> "One Hundre 阅读全文

posted @ 2017-12-07 01:59 逸朵阅读(118) 评论(0) 推荐(0)

2017年12月6日

Leetcode 268: Missing Number

摘要： Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. Example 1 Example 2 阅读全文

posted @ 2017-12-06 13:06 逸朵阅读(103) 评论(0) 推荐(0)

Leetcode 264: Ugly Number II

摘要： Write a program to find the n-th ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 阅读全文

posted @ 2017-12-06 12:31 逸朵阅读(139) 评论(0) 推荐(0)

Leetcode 263: Ugly Number

摘要： Write a program to check whether a given number is an ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For exa 阅读全文

posted @ 2017-12-06 12:11 逸朵阅读(111) 评论(0) 推荐(0)

2017年12月5日

Leetcode 257: Binary Tree Paths

摘要： Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: All root-to-leaf paths are: 阅读全文

posted @ 2017-12-05 13:29 逸朵阅读(145) 评论(0) 推荐(0)

Leetcode 241: Different Ways to Add Parentheses

摘要： Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. Th 阅读全文

posted @ 2017-12-05 07:20 逸朵阅读(138) 评论(0) 推荐(0)

Leetcode 239: Sliding Window Maximum

摘要： Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k num 阅读全文

posted @ 2017-12-05 05:25 逸朵阅读(153) 评论(0) 推荐(0)

Leetcode 238: Product of Array Except Self

摘要： Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except 阅读全文

posted @ 2017-12-05 01:44 逸朵阅读(156) 评论(0) 推荐(0)

Keep walking

公告