2018年10月18日
38. Count and Say
摘要： The count-and-say sequence is the sequence of integers with the first five terms as following: 1 is read off as "one 1" or 11.11 is read off as "two 1 阅读全文
posted @ 2018-10-18 12:21 一丝清风一抹红尘 阅读(122) 评论(0) 推荐(0) 编辑
849 Maximize Distance to Closest Person
摘要： In a row of seats, 1 represents a person sitting in that seat, and 0 represents that the seat is empty. There is at least one empty seat, and at least 阅读全文
posted @ 2018-10-18 12:03 一丝清风一抹红尘 阅读(252) 评论(0) 推荐(0) 编辑
459. Repeated Substring Pattern
摘要： Given a non-empty string check if it can be constructed by taking a substring of it and appending multiple copies of the substring together. You may a 阅读全文
posted @ 2018-10-18 11:09 一丝清风一抹红尘 阅读(142) 评论(0) 推荐(0) 编辑
2018年10月17日
1. Two Sum
摘要： Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input would have ex 阅读全文
posted @ 2018-10-17 19:12 一丝清风一抹红尘 阅读(98) 评论(0) 推荐(0) 编辑
482. License Key Formatting
摘要： You are given a license key represented as a string S which consists only alphanumeric character and dashes. The string is separated into N+1 groups b 阅读全文
posted @ 2018-10-17 18:59 一丝清风一抹红尘 阅读(127) 评论(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 阅读全文
posted @ 2018-10-17 17:59 一丝清风一抹红尘 阅读(118) 评论(0) 推荐(0) 编辑
110. Balanced Binary Tree
摘要： Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree in which the dep 阅读全文
posted @ 2018-10-17 14:48 一丝清风一抹红尘 阅读(119) 评论(0) 推荐(0) 编辑
232. Implement Queue using Stacks
摘要： mplement the following operations of a queue using stacks. push(x) -- Push element x to the back of queue. pop() -- Removes the element from in front 阅读全文
posted @ 2018-10-17 14:38 一丝清风一抹红尘 阅读(112) 评论(0) 推荐(0) 编辑
35. Search Insert Position
摘要： Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or 阅读全文
posted @ 2018-10-17 14:22 一丝清风一抹红尘 阅读(111) 评论(0) 推荐(0) 编辑
66. Plus One
摘要： Given a non-empty array of digits representing a non-negative integer, plus one to the integer. The digits are stored such that the most significant d 阅读全文
posted @ 2018-10-17 14:06 一丝清风一抹红尘 阅读(128) 评论(0) 推荐(0) 编辑