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 would have exactly one solution. Example: /** * Note: The returned array must be malloced, assume call…

Practice makes perfect 发音被儿子鄙视了.需要加强练习 以此自勉.…

算法刷题笔记 Leetcode-11. Container With Most Water Method: (对撞指针)每次保留两指针中最大的那个即可求得最大的面积 Runtime: 16 ms, faster than 95.65% of C++ online submissions for Container With Most Water. Memory Usage: 9.9 MB, less than 43.30% of C++ online submissions for Contai…

这个月最主要任务是linux shell script学习. 其次是继续spring源码学习. 其余时间C.C++和Java学习. 01 9月第一天,9点多才到家.做道简单的oj题练习下.因为简单,所以用不太熟悉的linux vim来搞.没想到出乎意料的顺利,看来最近的复习还是有点效果.不过我一直有个疑问,char* p; 和char *p;两种写法有什么区别? 02 周五,工作主要是收尾工作,抽时间继续华为的oj. 回家开始linux脚本学习. 03 周六,セックス.ついに男になる. 04 l…

This is a follow up of Shortest Word Distance. The only difference is now word1 could be the same as word2. Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list. word1 and word2 may be…

This is a follow up of Shortest Word Distance. The only difference is now you are given the list of words and your method will be called repeatedly many times with different parameters. How would you optimize it? Design a class which receives a list…

Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list. For example,Assume that words = ["practice", "makes", "perfect", "coding", "makes"]. G…

原题链接在这里:https://leetcode.com/problems/shortest-word-distance/ 题目: Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list. For example,Assume that words = ["practice", "makes&quo…

This is a follow up of Shortest Word Distance. The only difference is now word1 could be the same as word2. Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list. word1 and word2 may be…

Given a list of words and two words word1 and word2, return the shortest distance between these two words in the list. For example,Assume that words = ["practice", "makes", "perfect", "coding", "makes"]. G…