乐胖代购免代理版

LeetCode

原创 2015-02-25 14:43:30 946 阅读

[LeetCode]189 Rotate Array

https://oj.leetcode.com/problems/rotate-array/ public class Solution { public void rotate(int[] nums, int k) { &n

LeetCode

原创 2015-02-25 14:33:37 777 阅读

[LeetCode]186 Reverse Words in a String II

Question:Given an input string, reverse the string word by word.For example,Given s = "the sky is blue",return "blue is sky the".No extra space.// O(n) public String reverse(String

LeetCode

原创 2015-02-04 13:28:54 651 阅读

[LeetCode] replace into a Cyclic Sorted List

Question:Given a node from a cyclic linked list which has been sorted, write a function to insert a value into the list such that it remains a cyclic sorted list. The given node can be any single node

LeetCode

原创 2015-01-19 10:12:16 712 阅读

[LeetCode] A Distance Maximizing Problem

Question:Given an array A of integers, find the maximum of j-i subjected to the constraint of A[i] < A[j].// O(n) public int maxDistance(int[] A) { //&nb

LeetCode

转载精选 2015-01-19 09:42:19 1217 阅读

[LeetCode] Determine If Two Rectangles Overlap

Question:Given two axis-aligned rectangles A and B. Write a function to determine if the two rectangles overlap.http://leetcode.com/2011/05/determine-if-two-rectangles-overlap.html private static

LeetCode

转载精选 2015-01-19 09:21:54 690 阅读

[LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays

Question:Given two sorted arrays A, B of size m and n respectively. Find the k-th smallest element in the union of A and B. You can assume that there are no duplicate elements.http://leetcode.com/2011

LeetCode

转载精选 2015-01-19 06:49:25 2733 阅读

[LeetCode] Sliding Window Maximum

Question:A long array A[] is given to you. There is a sliding window of size w which is moving from the very left of the array to the very right. You can only see the w numbers in the window. Each tim

LeetCode

转载精选 2015-01-19 06:15:56 865 阅读

[LeetCode] String Reorder Distance Apart

Question:Given a string of lowercase characters, reorder them such that the same characters are at least distance d from each other.Input: { a, b, b }, distance = 2Output: { b, a, b }http://leetcode.c

LeetCode

转载精选 2015-01-18 14:14:48 460 阅读

[LeetCode] Multiplication Withtout Division

Question:There is an array A[N] of N numbers. You have to compose an array Output[N] such that Output[i] will be equal to multiplication of all the elements of A[N] except A[i]. Solve it without divis

interview

原创 2015-01-18 09:14:58 548 阅读

[LeetCode] Rotate Array / List

Question:http://leetcode.com/2010/04/rotating-array-in-place.html Rotate a one-dimensional array of n elements to the right by k steps. For instance, with n=7 and k=3, the array {a, b, c, d, e, f

LeetCode

原创 2015-01-18 08:39:56 641 阅读

[Twitter] Generate chars and *

Question:Given a list of string, like (a, b, c), return a list: (*, *, *), (a, *, *), (*, b, *), (*, *, c), (a, b, *), (a, * , c), (* , b, c), (a, b, c).// NP public List<List<String&g

interview

原创 2015-01-16 15:22:18 483 阅读

[Twitter] Max Stack

Question:Design a max stack using one stack. ?One stack? I think it is two stacks.class MaxMinStack<T> { private Stack<T> data; private Stack<

interview

原创 2015-01-16 11:02:02 547 阅读

[Twitter] Fibonacci Sequence

Question:Given a number n, give me a function that returns the nth fibonacci number. Running time, space complexity, iterative vs. recursive.http://www.glassdoor.com/Interview/Given-a-number-n-give-me

interview

原创 2015-01-16 10:46:10 597 阅读

[Twitter] Divide Without / Or %

Question:Implement Integer division without using / or %.http://www.glassdoor.com/Interview/Implement-integer-division-without-using-or-Questions-about-running-time-Can-you-do-it-faster-QTN_250205.htm

LeetCode

Twitter

原创 2015-01-16 05:45:09 802 阅读

[Twitter] Lowest Level Common Ancestor

Question:In a binary integer value tree, find the lowest level common ancestor of two values.http://www.glassdoor.com/Interview/In-a-binary-integer-value-tree-find-the-lowest-level-common-ancestor-of-

LeetCode

Twitter

原创 2015-01-16 04:36:46 583 阅读

[Twitter] All possible pickings

Question: Given n sets of choices: (1, 2, 3), (a, b, c), (i, ii, iii).You pick one element from each set of choices. Generate all possible pickings. http://www.glassdoor.com/Interview/Given-

NP

Twitter

原创 2015-01-16 03:56:55 378 阅读

Quick Sort

public static <T> void quickSort(T[] items) { quickSort(items, null); } public static <T> void quickSort(T[]&nbs

interview

原创 2015-01-15 04:47:44 657 阅读

[LintCode] First Bad Version

http://lintcode.com/en/problem/first-bad-version/ /** * public class VersionControl { * public static boolean isBadVersion(i

interview

原创 2015-01-15 03:39:03 490 阅读

[LintCode] Kth Prime Number

http://lintcode.com/en/problem/kth-prime-number/# class Solution { /** * @param k: The number k. &n

interview

原创 2015-01-14 17:04:21 1251 阅读

[LintCode] Compare Strings

http://lintcode.com/en/problem/compare-strings/ public class Solution { /** * @param A : A string inc

interview

原创 2015-01-14 15:41:14 521 阅读

LeetCode Sumary - Graph

Clone GraphBFS

LeetCode

原创 2015-01-14 15:21:45 435 阅读

[LintCode] Rehashing

http://lintcode.com/en/problem/rehashing/# /** * Definition for ListNode * public class ListNode { * int val; &nb

interview

原创 2015-01-14 15:09:02 746 阅读

[LeetCode]174 Dungeon Game

https://oj.leetcode.com/problems/dungeon-game/ public class Solution { public int calculateMinimumHP(int[][] map) {

LeetCode

原创 2015-01-14 14:55:04 588 阅读

[LeetCode]173 Binary Search Tree Iterator

https://oj.leetcode.com/problems/binary-search-tree-iterator/ /** * Definition for binary tree * public class TreeNode { * &n

LeetCode

原创 2015-01-14 14:33:57 374 阅读

[LeetCode]179 Largest Number

https://oj.leetcode.com/problems/largest-number/ public class Solution { public String largestNumber(int[] num) { &n

LeetCode

原创 2015-01-14 14:11:27 412 阅读

[LintCode] Backpack II

http://lintcode.com/en/problem/backpack-ii/ public int backPackII(int m, int[] A, int V[]) { &

LeetCode

原创 2015-01-12 06:41:49 522 阅读

[LintCode] Backpack

http://lintcode.com/en/problem/backpack/ public class Solution { /** * @param m: An integer m denot

LeetCode

原创 2015-01-12 06:02:16 1011 阅读

[LeetCode]156 Binary Tree Upside Down

https://oj.leetcode.com/problems/binary-tree-upside-down/http://blog.csdn.net/xudli/article/details/42362441 /** * Definition for binary tree * public class&n

LeetCode

原创 2015-01-09 17:22:35 604 阅读

[LeetCode]172 Factorial Trailing Zeroes

https://oj.leetcode.com/problems/factorial-trailing-zeroes/ public class Solution { public int trailingZeroes(int n) { &nbs

LeetCode

原创 2015-01-09 17:02:57 368 阅读

官方博客	全部文章	热门标签	班级博客
了解我们	网站地图	意见反馈

鸿蒙开发者社区	51CTO学堂
51CTO	软考资讯

51CTO博客

7361901

欢迎

[LeetCode]187 Repeated DNA Sequences

[LeetCode]189 Rotate Array

[LeetCode]186 Reverse Words in a String II

[LeetCode] replace into a Cyclic Sorted List

[LeetCode] A Distance Maximizing Problem

[LeetCode] Determine If Two Rectangles Overlap

[LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays

[LeetCode] Sliding Window Maximum

[LeetCode] String Reorder Distance Apart

[LeetCode] Multiplication Withtout Division

[LeetCode] Rotate Array / List

[Twitter] Generate chars and *

[Twitter] Max Stack

[Twitter] Fibonacci Sequence

[Twitter] Divide Without / Or %

[Twitter] Lowest Level Common Ancestor

[Twitter] All possible pickings

Quick Sort

[LintCode] First Bad Version

[LintCode] Kth Prime Number

[LintCode] Compare Strings

LeetCode Sumary - Graph

[LintCode] Rehashing

[LeetCode]174 Dungeon Game

[LeetCode]173 Binary Search Tree Iterator

[LeetCode]179 Largest Number

[LintCode] Backpack II

[LintCode] Backpack

[LeetCode]156 Binary Tree Upside Down

[LeetCode]172 Factorial Trailing Zeroes