panini - 博客园

2017年4月26日

302. Smallest Rectangle Enclosing Black Pixels

摘要：题目： An image is represented by a binary matrix with 0 as a white pixel and 1 as a black pixel. The black pixels are connected, i.e., there is only one 阅读全文

posted @ 2017-04-26 11:00 panini 阅读(187) 评论(0) 推荐(0) 编辑

60. Permutation Sequence

摘要：题目： The set [1,2,3,…,n] contains a total of n! unique permutations. By listing and labeling all of the permutations in order,We get the following sequ 阅读全文

posted @ 2017-04-26 06:14 panini 阅读(191) 评论(0) 推荐(0) 编辑

2017年4月25日

[LintCode] 74 First Bad Version

摘要： DescriptionThe code base version is an integer start from 1 to n. One day, someone committed a bad version in the code case, so it caused this version 阅读全文

posted @ 2017-04-25 11:02 panini 阅读(208) 评论(0) 推荐(0) 编辑

[LintCode] 75 Find Peak Element

摘要： DescriptionThere is an integer array which has the following features:The numbers in adjacent positions are different.A[0] < A[1] && A[A.length - 2] > 阅读全文

posted @ 2017-04-25 10:57 panini 阅读(188) 评论(0) 推荐(0) 编辑

[LintCode] 159 Find Minimum in Rotated Sorted Array

摘要： DescriptionSuppose a sorted array 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 the minimum 阅读全文

posted @ 2017-04-25 10:38 panini 阅读(157) 评论(0) 推荐(0) 编辑

445. Add Two Numbers II

摘要：题目： You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their nodes co 阅读全文

posted @ 2017-04-25 10:04 panini 阅读(162) 评论(0) 推荐(0) 编辑

5. Longest Palindromic Substring

摘要：题目： Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example: Example: 链接：https://l 阅读全文

posted @ 2017-04-25 10:04 panini 阅读(114) 评论(0) 推荐(0) 编辑

138. Copy List with Random Pointer

摘要：题目： A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null. Return a deep 阅读全文

posted @ 2017-04-25 10:03 panini 阅读(453) 评论(0) 推荐(0) 编辑

56. Merge Intervals

摘要：题目： Given a collection of intervals, merge all overlapping intervals. For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18]. 链接：htt 阅读全文

posted @ 2017-04-25 10:03 panini 阅读(167) 评论(0) 推荐(0) 编辑

386. Lexicographical Numbers

摘要：题目： Given an integer n, return 1 - n in lexicographical order. For example, given 13, return: [1,10,11,12,13,2,3,4,5,6,7,8,9]. Please optimize your al 阅读全文

posted @ 2017-04-25 10:03 panini 阅读(153) 评论(0) 推荐(0) 编辑

公告