bernieloveslife

2018年10月30日

摘要： A website domain like "discuss.leetcode.com" consists of various subdomains. At the top level, we have "com", at the next level, we have "leetcode.com 阅读全文

posted @ 2018-10-30 12:09 bernieloveslife 阅读(150) 评论(0) 推荐(0)

901. Online Stock Span

摘要： Write a class StockSpanner which collects daily price quotes for some stock, and returns the span of that stock's price for the current day. The span 阅读全文

posted @ 2018-10-30 12:09 bernieloveslife 阅读(237) 评论(0) 推荐(0)

419. Battleships in a Board

摘要： Given an 2D board, count how many battleships are in it. The battleships are represented with 'X's, empty slots are represented with '.'s. You may ass 阅读全文

posted @ 2018-10-30 12:09 bernieloveslife 阅读(145) 评论(0) 推荐(0)

2018年10月29日

620. Not Boring Movies

摘要： X city opened a new cinema, many people would like to go to this cinema. The cinema also gives out a poster indicating the movies’ ratings and descrip 阅读全文

posted @ 2018-10-29 13:12 bernieloveslife 阅读(197) 评论(0) 推荐(0)

893. Groups of Special-Equivalent Strings

摘要： You are given an array A of strings. Two strings S and T are special equivalent if after any number of moves, S == T. A move consists of choosing two 阅读全文

posted @ 2018-10-29 13:12 bernieloveslife 阅读(117) 评论(0) 推荐(0)

575. Distribute Candies

摘要： Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of th 阅读全文

posted @ 2018-10-29 13:12 bernieloveslife 阅读(88) 评论(0) 推荐(0)

868. Binary Gap

摘要： Given a positive integer N, find and return the longest distance between two consecutive 1's in the binary representation of N. If there aren't two co 阅读全文

posted @ 2018-10-29 13:12 bernieloveslife 阅读(100) 评论(0) 推荐(0)

821. Shortest Distance to a Character

摘要： Given a string S and a character C, return an array of integers representing the shortest distance from the character C in the string. Example 1: Inpu 阅读全文

posted @ 2018-10-29 13:12 bernieloveslife 阅读(137) 评论(0) 推荐(0)

2018年10月28日

数串

摘要：题目描述设有n个正整数，将他们连接成一排，组成一个最大的多位整数。如:n=3时，3个整数13,312,343,连成的最大整数为34331213。如:n=4时,4个整数7,13,4,246连接成的最大整数为7424613。输入描述: 有多组测试样例，每组测试样例包含两行，第一行为一个整数N（N 阅读全文

posted @ 2018-10-28 14:10 bernieloveslife 阅读(159) 评论(0) 推荐(0)

树的高度(并不需要建树，并不需要考虑谁是谁的孩子，因为输入保证了先父节点)

摘要：题目描述现在有一棵合法的二叉树，树的节点都是用数字表示，现在给定这棵树上所有的父子关系，求这棵树的高度输入描述: 输入的第一行表示节点的个数n（1 ≤ n ≤ 1000，节点的编号为0到n 1）组成，下面是n 1行，每行有两个整数，第一个数表示父节点的编号，第二个数表示子节点的编号输出描述: 阅读全文

posted @ 2018-10-28 14:10 bernieloveslife 阅读(216) 评论(0) 推荐(0)

公告