10 2019 档案

摘要:Given a string of and parentheses, we add the minimum number of parentheses ( or , and in any positions ) so that the resulting parentheses string is 阅读全文
posted @ 2019-10-31 04:28 Grandyang 阅读(2304) 评论(0) 推荐(0) 编辑
摘要:This page is used to inform visitors regarding my policies with the collection, use, and disclosure of Personal Information if anyone decided to use m 阅读全文
posted @ 2019-10-30 20:27 Grandyang 阅读(308) 评论(0) 推荐(0) 编辑
摘要:Your music player contains different songs and she wants to listen to (not necessarily different) songs during your trip. You create a playlist so tha 阅读全文
posted @ 2019-10-25 23:54 Grandyang 阅读(2318) 评论(2) 推荐(1) 编辑
摘要:A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possibl 阅读全文
posted @ 2019-10-23 23:55 Grandyang 阅读(5139) 评论(4) 推荐(0) 编辑
摘要:Given a circular array C of integers represented by , find the maximum possible sum of a non empty subarray of C. Here, a circular array means the end 阅读全文
posted @ 2019-10-21 21:26 Grandyang 阅读(5189) 评论(2) 推荐(0) 编辑
摘要:Given a string , return the "reversed" string where all characters that are not a letter stay in the same place, and all letters reverse their positio 阅读全文
posted @ 2019-10-18 23:43 Grandyang 阅读(2292) 评论(0) 推荐(1) 编辑
摘要:In a 2D grid of s and s, we change at most one to a . After, what is the size of the largest island? (An island is a 4 directionally connected group o 阅读全文
posted @ 2019-10-13 23:32 Grandyang 阅读(3748) 评论(2) 推荐(0) 编辑
摘要:We are given two arrays and of words. Each word is a string of lowercase letters. Now, say that word is a subset of word if every letter in occurs in 阅读全文
posted @ 2019-10-04 23:33 Grandyang 阅读(2543) 评论(0) 推荐(0) 编辑
摘要:Let's define a function that returns the number of unique characters on , for example if then , ,`"C" "O" "D" s`, therefore . On this problem given a 阅读全文
posted @ 2019-10-01 23:36 Grandyang 阅读(3390) 评论(0) 推荐(0) 编辑

Fork me on GitHub