I’m practising my programming skills on LeetCode.

This demo implemented the **Two Sum**:

Given an array of integers, return

indicesof the two numbers such that they add up to a specific target.You may assume that each input would have

one solution, and you may not use theexactlysameelement twice.

Example:Given nums = [2, 7, 11, 15], target = 9,

from LeetCode No.1 problem

Because nums[0] + nums[1] = 2 + 7 = 9, return [0,1].

You can choose your favourite language to solve the problems.

I chose JavaScript this time, and then implemented with MaxMSP too.

The MaxMSP version is totally made of Max objects without JavaScript in it.

Source code:

https://www.patreon.com/posts/33970212

中文视频B站：

https://www.bilibili.com/video/av88576497/

源代码：

微信公众号/知识星球：实验编程