上一页 1 ··· 35 36 37 38 39 40 41 42 43 ··· 76 下一页
摘要: There is a room with n lights which are turned on initially and 4 buttons on the wall. After performing exactly m unknown operations towards buttons, 阅读全文
posted @ 2020-03-12 13:43 Schwifty 阅读(134) 评论(0) 推荐(0)
摘要: There is a room with n bulbs, numbered from 1 to n, arranged in a row from left to right. Initially, all the bulbs are turned off. At moment k (for k  阅读全文
posted @ 2020-03-12 13:12 Schwifty 阅读(384) 评论(0) 推荐(0)
摘要: A company has n employees with a unique ID for each employee from 0 to n - 1. The head of the company has is the one with headID. Each employee has on 阅读全文
posted @ 2020-03-12 04:57 Schwifty 阅读(224) 评论(0) 推荐(0)
摘要: Given a binary tree root, a ZigZag path for a binary tree is defined as follow: Choose any node in the binary tree and a direction (right or left). If 阅读全文
posted @ 2020-03-12 01:38 Schwifty 阅读(525) 评论(0) 推荐(0)
摘要: Given an integer n, return a string with n characters such that each character in such string occurs an odd number of times. The returned string must 阅读全文
posted @ 2020-03-12 00:16 Schwifty 阅读(471) 评论(0) 推荐(0)
摘要: Given the string s, return the size of the longest substring containing each vowel an even number of times. That is, 'a', 'e', 'i', 'o', and 'u' must 阅读全文
posted @ 2020-03-11 08:36 Schwifty 阅读(271) 评论(0) 推荐(0)
摘要: Given a string s. You should re-order the string using the following algorithm: Pick the smallest character from s and append it to the result. Pick t 阅读全文
posted @ 2020-03-11 07:57 Schwifty 阅读(352) 评论(0) 推荐(0)
摘要: In a special ranking system, each voter gives a rank from highest to lowest to all teams participated in the competition. The ordering of teams is dec 阅读全文
posted @ 2020-03-02 11:10 Schwifty 阅读(619) 评论(0) 推荐(0)
摘要: You have n binary tree nodes numbered from 0 to n - 1 where node i has two children leftChild[i] and rightChild[i], return true if and only if all the 阅读全文
posted @ 2020-02-27 11:46 Schwifty 阅读(250) 评论(0) 推荐(0)
摘要: Given n orders, each order consist in pickup and delivery services. Count all valid pickup/delivery possible sequences such that delivery(i) is always 阅读全文
posted @ 2020-02-25 12:09 Schwifty 阅读(380) 评论(0) 推荐(0)
上一页 1 ··· 35 36 37 38 39 40 41 42 43 ··· 76 下一页