2015年10月_Easylove-xjl

11月 10月

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.

2015-10-29 16:23:33 320

Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

2015-10-28 22:26:21 292

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.

2015-10-28 21:31:36 382

Given numRows, generate the first numRows of Pascal’s triangle.

2015-10-28 21:01:59 368

Given a sorted integer array without duplicates, return the summary of its ranges.

2015-10-27 16:24:56 254

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.

2015-10-26 20:51:29 312

Given an array and a value, remove all instances of that value in place and return the new length.

2015-10-26 20:29:45 267

Setup Hadoop On Ubuntu 14.04 Linux —Multi-Node Cluster

2015-10-24 20:57:22 481

Rotate an array of n elements to the right by k steps.

2015-10-24 20:23:56 341

Given a non-negative number represented as an array of digits, plus one to the number.用一个数组来代表一个非负整数，对这个整数进行+1操作。

2015-10-22 10:33:48 308

contains duplicates

2015-10-21 21:05:25 248

给定k个序列s1,s2,s3,...,sk,用二路合并方法将k个序列合并为一个。假设将任意两个长度分别为n和m的序列合并为一个需要的代价是m+n-1，设计一个算法来确定合并这些序列的合并为一个的最大代价和最小代价。

2012-10-07

TA创建的收藏夹 TA关注的收藏夹

TA关注的人