...繼續閱讀 »

...繼續閱讀 »

...繼續閱讀 »

...繼續閱讀 »

...繼續閱讀 »

### [TDD] leet code 220. Contains Duplicate III

Given an array of integers, find out whether there are two distinct indices i and j in the array such that the absolute difference between nums[i] and nums[j] is at most t and the absolute difference between i and j is at most k.

...繼續閱讀 »

### [AHA 2017]講師採訪－91的學習永動機模型

• 1234
• 0
• 2018-01-03

AHA 2017 大會將於 4/13 ~ 4/15 在上海舉辦，報名與活動詳情請見 2017AHA大会

...繼續閱讀 »

...繼續閱讀 »

### [TDD]Find the Next Bigger Number from Codewars

Codewars 上的 kata: Next bigger number with the same digits

You have to create a function that takes a positive integer number and returns the next bigger number formed by the same digits:
f(12) == 21
f(513) == 531
f(2017) == 2071

If no bigger number can be composed using those digits, return -1:
f(9) == -1
f(111) == -1
f(531) == -1

...繼續閱讀 »

### [TDD] leet code 219. Contains Duplicate II

Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the absolute difference between i and j is at most k.

...繼續閱讀 »