Leetcode刷题记录帖

感谢楼主分享刷题纪录！
这样督促自己刷题挺不错的
目前我也是每周末比Leetcode weekly contest
一起加油～

wenluvLA 发表于 2018-5-28 06:40
感谢楼主分享刷题纪录！
这样督促自己刷题挺不错的
目前我也是每周末比Leetcode weekly contest

是的 Leetcode Weekly Contest坚持参加下来帮助会很大
一起加油！╭(′▽`)╭(′▽`)╯

May 28th 2018 --- 1 Problem

## 318. Maximum Product of Word Lengths (Medium)

Use bit to stand wether one word contains some characters or not (26 bits which is less than 31 bits).
When comparing two words, just do and operation to these two numbers.

May 29th 2018 --- 1 Problem

## 319. Bulb Switcher (Medium)

All the numbers with even factors will be off at last, left only those odd factors ones: square numbers.

May 30th 2018 --- 1 Problem

## 321. Create Maximum Number (Hard)

Enumerate how many digits we select from each array and merge them together. During merging, we should compare whole postfix subarray instead of two single digits.

每天坚持 不容易 加油

tangzy09 发表于 2018-5-31 01:39
每天坚持 不容易 加油

谢谢！事情一多效率就低了 一天也就刷个一道题维持着

May 31st 2018 --- 1 Problem

## 215. Kth Largest Element in an Array (Medium)

### 1. QuickSort O(nlogn) + O(1)
### 2. Heap O(nlogn) + O(n)
### 3. QuickSelect O(n) + O(1)
Kind of like QuickSort. Instead of sorting both half sides, we only sort the half which k falls in.

Jun. 1st 2018 --- 1 Problem

## 324. Wiggle Sort II (Medium)

### 1. Sort O(nlogn) + O(1)

### 2. findKthNumber + 3Partition O(n) + O(n)

### 3. findKthNumber + 3Partition + IndexMap O(n) + O(1)

这样的打卡真的会有帮助！