278. First Bad Version
You are a product manager and currently leading a team ... » 阅读全文
You are a product manager and currently leading a team ... » 阅读全文
Given an array nums containing n distinct numbers in th... » 阅读全文
Write a program to check whether a given number is an u... » 阅读全文
给定一个非负整数num,反复将各个位上的数字相加,直到结果为一位数。返回这个结果。 示例 1: 输入: num... » 阅读全文
Given a binary tree, return all root-to-leaf paths. Not... » 阅读全文
Given a binary search tree (BST), find the lowest commo... » 阅读全文
Given a singly linked list, determine if it is a palind... » 阅读全文
Implement a first in first out (FIFO) queue using only ... » 阅读全文
Given an integer n, return true if it is a power of two... » 阅读全文
You are given a sorted unique integer array nums. Retur... » 阅读全文