leetcode
文章平均质量分 70
ULtrapp
寻求编程和生活之美~
展开
-
leetcode 231
231. Power of Two Total Accepted: 86376Total Submissions: 228380Difficulty: Easy Given an integer, write a function to determine if it is a power of two. Credits: Special t原创 2016-07-21 14:09:22 · 259 阅读 · 0 评论 -
leetcode 238. Product of Array Except Self
Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i]. Solve it without division and in O(n).原创 2016-07-21 18:06:55 · 252 阅读 · 0 评论 -
leetcode 237. Delete Node in a Linked List
Write a function to delete a node (except the tail) in a singly linked list, given only access to that node. Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value原创 2016-07-21 17:43:29 · 260 阅读 · 0 评论 -
leetcode 376. Wiggle Subsequence
A sequence of numbers is called a wiggle sequence if the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may be either pos原创 2016-07-21 17:26:11 · 1436 阅读 · 1 评论 -
leetcode 283. Move Zeroes
Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements. For example, given nums = [0, 1, 0, 3, 12], after calling your fu原创 2016-07-21 16:37:06 · 208 阅读 · 0 评论 -
leetcode 260. Single Number III
Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once. For example: Given nums =原创 2016-07-21 16:35:33 · 230 阅读 · 0 评论 -
leetcode 226. Invert Binary Tree
Invert a binary tree. 4 / \ 2 7 / \ / \ 1 3 6 9 to 4 / \ 7 2 / \ / \ 9 6 3 1 Trivia: This problem was inspired by this original tweet by Max Howe原创 2016-07-21 15:45:32 · 183 阅读 · 0 评论 -
leetcode 104. Maximum Depth of Binary Tree
104. Maximum Depth of Binary Tree Total Accepted: 160295Total Submissions: 328352Difficulty: Easy Given a binary tree, find its maximum depth. The maximum depth is the numbe原创 2016-07-21 15:42:22 · 268 阅读 · 0 评论 -
leetcode 258
258. Add Digits Total Accepted: 110807Total Submissions: 224904Difficulty: Easy Given a non-negative integer num, repeatedly add all its digits until the result has only one原创 2016-07-21 15:35:49 · 223 阅读 · 0 评论 -
leetcode 136
136. Single Number Total Accepted: 139245Total Submissions: 273783Difficulty: Medium Given an array of integers, every element appears twice except for one. Find that single原创 2016-07-21 15:30:57 · 240 阅读 · 0 评论 -
leetcode 371
371. Sum of Two Integers Total Accepted: 15459Total Submissions: 29688Difficulty: Easy Calculate the sum of two integers a and b, but you are not allowed to use the operato原创 2016-07-21 15:17:25 · 194 阅读 · 0 评论 -
leetcode 7
7. Reverse Integer Total Accepted: 152273Total Submissions: 640718Difficulty: Easy Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -3原创 2016-07-21 14:58:06 · 222 阅读 · 0 评论 -
leetcode 100. Same Tree
Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value. Subscribe to原创 2016-07-21 18:37:57 · 252 阅读 · 0 评论