程序媛詹妮弗
终身学习
摘要: Suppose an array sorted in ascending order 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]). Y 阅读全文
posted @ 2018-10-20 08:03 程序媛詹妮弗 阅读(137) 评论(0) 推荐(0) 编辑
摘要: Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array. Note: The number of elements initialized in nums1 and num 阅读全文
posted @ 2018-10-20 07:04 程序媛詹妮弗 阅读(133) 评论(0) 推荐(0) 编辑
摘要: Given the running logs of n functions that are executed in a nonpreemptive single threaded CPU, find the exclusive time of these functions. Each funct 阅读全文
posted @ 2018-10-20 06:50 程序媛詹妮弗 阅读(109) 评论(0) 推荐(0) 编辑
摘要: Given a binary tree, return all root-to-leaf paths. Note: A leaf is a node with no children. Example: 题目 给定一棵二叉树,求出所有根到叶的路径。 思路 DFS, Very straightforw 阅读全文
posted @ 2018-10-20 06:42 程序媛詹妮弗 阅读(97) 评论(0) 推荐(0) 编辑
摘要: Given a list accounts, each element accounts[i] is a list of strings, where the first element accounts[i][0] is a name, and the rest of the elements a 阅读全文
posted @ 2018-10-20 05:57 程序媛詹妮弗 阅读(312) 评论(0) 推荐(0) 编辑