bernieloveslife

2018年10月12日

摘要： There are N network nodes, labelled 1 to N. Given times, a list of travel times as directed edges times[i] = (u, v, w), where u is the source node, v 阅读全文

posted @ 2018-10-12 10:59 bernieloveslife 阅读(203) 评论(0) 推荐(0) 编辑

704.Binary Search（二分查找）

摘要： Given a sorted (in ascending order) integer array nums of n elements and a target value, write a function to search target in nums. If target exists, 阅读全文

posted @ 2018-10-12 10:59 bernieloveslife 阅读(158) 评论(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-12 10:59 bernieloveslife 阅读(188) 评论(0) 推荐(0) 编辑

2018年10月11日

572.Subtree of Another Tree

摘要： Given two non empty binary trees s and t, check whether tree t has exactly the same structure and node values with a subtree of s. A subtree of s is a 阅读全文

posted @ 2018-10-11 10:26 bernieloveslife 阅读(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-11 10:25 bernieloveslife 阅读(132) 评论(0) 推荐(0) 编辑

198.House Robber（dp）

摘要： You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping yo 阅读全文

posted @ 2018-10-11 10:25 bernieloveslife 阅读(85) 评论(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-11 10:25 bernieloveslife 阅读(80) 评论(0) 推荐(0) 编辑

705.Design HashSet

摘要： Design a HashSet without using any built in hash table libraries. To be specific, your design should include these functions: add(value): Insert a val 阅读全文

posted @ 2018-10-11 10:25 bernieloveslife 阅读(217) 评论(0) 推荐(0) 编辑

2018年10月10日

103.Binary Tree Zigzag Level Order Traversal（层序遍历）

摘要： Given a binary tree, return the zigzag level order traversal of its nodes' values. (ie, from left to right, then right to left for the next level and 阅读全文

posted @ 2018-10-10 10:52 bernieloveslife 阅读(97) 评论(0) 推荐(0) 编辑

181.Employees Earning More Than Their Mangers

摘要： The Employee table holds all employees including their managers. Every employee has an Id, and there is also a column for the manager Id. + + + + + | 阅读全文

posted @ 2018-10-10 10:52 bernieloveslife 阅读(122) 评论(0) 推荐(0) 编辑

公告