2018年9月15日

leetcode 1. Two Sum

摘要: 1. Two Sum Given an array of integers, return indices of the two numbers such that they add up to a specific target. You may assume that each input wo 阅读全文

posted @ 2018-09-15 14:45 ming_jia 阅读(126) 评论(0) 推荐(0)

leetcode 462. Minimum Moves to Equal Array Elements II

摘要: 这道题目和leetcode453是有联系的,虽然这道题难度为中等,但是我感觉初等难度的453绕的弯子更大一些。 题目:Given a non-empty integer array, find the minimum number of moves required to make all arra 阅读全文

posted @ 2018-09-15 09:33 ming_jia 阅读(183) 评论(0) 推荐(0)

导航