zhjy23212-CSDN博客

原创 239. Sliding Window Maximum

239. Sliding Window Maximum Given an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see the k numbers in the window.

2016-07-02 11:27:57 268

原创 328. Odd Even Linked List

328. Odd Even Linked List Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.

2016-07-01 02:59:30 210

原创 318. Maximum Product of Word Lengths

318. Maximum Product of Word Lengths Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each

2016-06-30 05:09:20 265

原创 [LC 94 144 145]Binary Tree Traversal ( preorder, inorder,postorder)

94. Binary Tree Inorder Traversal Given a binary tree, return the inorder traversal of its nodes’ values. For example: Given binary tree [1,null,2,3], return [1,3,2]. Note: Recursiv

2016-06-29 14:39:31 254

原创 [LC352]Data Stream as Disjoint Intervals

352. Data Stream as Disjoint Intervals Given a data stream input of non-negative integers a1, a2, …, an, …, summarize the numbers seen so far as a list of disjoint intervals.

2016-06-29 03:10:36 247

原创 [LC319] Bulb Switcher

319. Bulb Switcher There are n bulbs that are initially off. You first turn on all the bulbs. Then, you turn off every second bulb.

2016-06-29 02:05:39 206

原创 [LC343] Integer Break

343. Integer Break Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.

2016-06-29 01:47:46 227

原创 [LC357]Count Numbers with Unique Digits

357. Count Numbers with Unique Digits Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n.

2016-06-28 14:14:32 415

原创 [LC347] Top K Frequent Elements

347. Top K Frequent Elements Given a non-empty array of integers, return the k most frequent elements.

2016-06-28 13:44:00 374

原创 [LC238] Product of Array Except Self

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]. S

2016-06-28 12:57:47 223

原创 [LC260]Single Number III

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.

2016-06-28 12:21:30 275

原创 [LC136] Single Number

Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement it without using

2016-06-28 09:39:30 257

原创 [LC338] Counting Bits

Total Accepted: 29725 Total Submissions: 52050 Difficulty: Medium Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1’s in their

2016-06-28 09:23:46 358

原创 leetcode再出发

终于想到认真仔细梳理一遍自己做的算法题之前做的态度太过随意，一个是不求甚解，有个结果通过就行，一个是做不出了参考他人思路但没有仔细消化，造成第二次做题还是陌生。之前在 Google 的面试就是吃了题目不熟练的亏，换做他人大概早就拿到 offer 了，只能责怪自己准备不足就敢上阵。于是决定重新来一遍 leetcode 的题目，讲解对象是电脑边的小黄鸭或者只有基础数

2016-06-28 08:41:46 338

zhjy修炼中