LeetCode
文章平均质量分 55
软货
不想软下去的男人!!!
展开
-
【LeetCode】Add Two Numbers
【LeetCode】Add Two Numbers问题描述You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit.原创 2015-06-25 21:13:51 · 432 阅读 · 0 评论 -
【LeetCode】Contains Duplicate II
Contains Duplicate II问题描述Given an array of integers and an integer k, find out whether there there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i原创 2015-07-16 11:03:27 · 1065 阅读 · 0 评论 -
【LeetCode】Number of Islands
Given a 2d grid map of ‘1’s (land) and ‘0’s (water), count the number of islands. An island is surrounded by water and is formed by connecting adjacent lands horizontally or verti原创 2015-07-15 11:21:54 · 644 阅读 · 0 评论 -
【LeetCode】Basic Calculator II
【LeetCode】Basic Calculator IIImplement a basic calculator to evaluate a simple expression string. The expression string contains only non-negative integers, +, -, *, / operators and empty spaces .原创 2015-07-13 18:06:42 · 688 阅读 · 0 评论 -
【LeetCode】Kth Smallest Element in a BST
问题描述Given a binary search tree, write a function kthSmallest to find the kth smallest element in it. Note: You may assume k is always valid, 1 ≤ k ≤ BST’s total elements.算法思想BST中序遍历为排序序列,直接技术前k个访问的数原创 2015-07-06 17:15:12 · 601 阅读 · 0 评论 -
【LeetCode】Search for a Range
问题描述Given a sorted array of integers, find the starting and ending position of a given target value. Your algorithm’s runtime complexity must be in the order of O(log n). If the target is not found i原创 2015-07-06 11:37:27 · 475 阅读 · 0 评论 -
【LeetCode】Happy Number
Happy Number问题描述Write an algorithm to determine if a number is “happy”.A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of原创 2015-07-14 12:09:45 · 643 阅读 · 0 评论 -
【LeetCode】Power of Two
问题描述Given an integer, write a function to determine if it is a power of two. 意:判断一个数是否是2的n次幂算法思想如果一个数小于或等于0,一定不是2的幂次数 如果一个大于0且数是2的n次幂,则其的二进制形式有且仅有一个1,反之成立。算法实现public class Solution { public boole原创 2015-07-06 13:38:38 · 1485 阅读 · 0 评论 -
【LeetCode】Majority Element II
Given an integer array of size n, find all elements that appear more than ⌊ n/3 ⌋ times. The algorithm should run in linear time and in O(1) space.查找数组主元素原创 2015-07-05 18:21:37 · 589 阅读 · 0 评论 -
【LeetCode】Summary Ranges
问题描述Given a sorted integer array without duplicates, return the summary of its ranges. For example, given [0,1,2,4,5,7], return [“0->2”,”4->5”,”7”]. 意:找出排序数组(无重复数字)中的各个连续的范围原创 2015-06-29 09:46:41 · 1108 阅读 · 0 评论 -
【LeetCode】Longest Substring Without Repeating Characters
【LeetCode】Longest Substring Without Repeating CharactersGiven a string, find the length of the longest substring without repeating characters. 查找给定字符串中最长的无重复字符的子串原创 2015-06-26 15:04:09 · 674 阅读 · 0 评论 -
【LeetCode】Contains Duplicate
Contains Duplicate问题描述Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return fals原创 2015-07-16 11:21:44 · 614 阅读 · 2 评论