11 2017 档案

278. First Bad Version 第一个坏的版本
摘要：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 阅读(580) 评论(0) 推荐(0)
734. Sentence Similarity 句子相似性
摘要：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 阅读(376) 评论(0) 推荐(0)
479. Largest Palindrome Product 最大的回文产品
摘要：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)
733. Flood Fill 填充图像
摘要：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 阅读(842) 评论(0) 推荐(0)
728. Self Dividing Numbers 自分数
摘要：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 阅读(250) 评论(0) 推荐(0)
724. Find Pivot Index 查找枢轴索引
摘要：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 阅读(233) 评论(0) 推荐(0)
720. Longest Word in Dictionary 字典中最长的单词
摘要：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 阅读(699) 评论(0) 推荐(0)
725. Split Linked List in Parts 拆分链表
摘要：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 阅读(175) 评论(0) 推荐(0)
655.Print Binary Tree 打印二叉树
摘要：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 阅读(194) 评论(0) 推荐(0)
717. 1-bit and 2-bit Characters 1、2位字符
摘要：We have two special characters. The first character can be represented by one bit 0. The second character can be represented by two bits (10 or 11).Now given a string represented by several bits. Retu... 阅读全文
posted @ 2017-11-04 18:18 xiejunzhao 阅读(309) 评论(0) 推荐(0)
443. String Compression 字符串压缩
摘要：Given an array of characters, compress it in-place.The length after compression must always be smaller than or equal to the original array.Every element of the array should be a character (not int) of... 阅读全文
posted @ 2017-11-04 18:18 xiejunzhao 阅读(1070) 评论(0) 推荐(0)