上一页 1 2 3 4 5 6 7 8 9 10 ··· 27 下一页
摘要: Given a list of daily temperatures, produce a list that, for each day in the input, tells you how many days you would have to wait until a warmer temperature. If there is no future day for which ... 阅读全文
posted @ 2017-12-06 22:43 xiejunzhao 阅读(437) 评论(0) 推荐(0)
摘要: You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on ... 阅读全文
posted @ 2017-11-28 23:58 xiejunzhao 阅读(583) 评论(0) 推荐(0)
摘要: Find the largest palindrome made from the product of two n-digit numbers. Since the result could be very large, you should return the largest palindrome mod 1337.Example:Input: 2Output: 987Explanation... 阅读全文
posted @ 2017-11-28 23:57 xiejunzhao 阅读(254) 评论(0) 推荐(0)
摘要: Given two sentences words1, words2 (each represented as an array of strings), and a list of similar word pairs pairs, determine if two sentences are similar. For example, "great acting skills" and "f... 阅读全文
posted @ 2017-11-28 23:57 xiejunzhao 阅读(383) 评论(0) 推荐(0)
摘要: An image is represented by a 2-D array of integers, each integer representing the pixel value of the image (from 0 to 65535). Given a coordinate (sr, sc) representing the starting pixel (row and col... 阅读全文
posted @ 2017-11-26 23:16 xiejunzhao 阅读(843) 评论(0) 推荐(0)
摘要: A self-dividing number is a number that is divisible by every digit it contains. For example, 128 is a self-dividing number because 128 % 1 == 0, 128 % 2 == 0, and 128 % 8 == 0. Also, a self-dividi... 阅读全文
posted @ 2017-11-25 20:35 xiejunzhao 阅读(252) 评论(0) 推荐(0)
摘要: Given an array of integers nums, write a method that returns the "pivot" index of this array.We define the pivot index as the index where the sum of the numbers to the left of the index is equal to th... 阅读全文
posted @ 2017-11-16 22:03 xiejunzhao 阅读(235) 评论(0) 推荐(0)
摘要: Given a (singly) linked list with head node root, write a function to split the linked list into k consecutive linked list "parts".The length of each part should be as equal as possible: no two parts ... 阅读全文
posted @ 2017-11-16 22:02 xiejunzhao 阅读(176) 评论(0) 推荐(0)
摘要: Given a list of strings words representing an English Dictionary, find the longest word in words that can be built one character at a time by other words in words. If there is more than one possible a... 阅读全文
posted @ 2017-11-16 22:02 xiejunzhao 阅读(702) 评论(0) 推荐(0)
摘要: Print a binary tree in an m*n 2D string array following these rules:The row number m should be equal to the height of the given binary tree.The column number n should always be an odd number.The root ... 阅读全文
posted @ 2017-11-06 23:42 xiejunzhao 阅读(198) 评论(0) 推荐(0)
上一页 1 2 3 4 5 6 7 8 9 10 ··· 27 下一页