贪心解。尽可能的选择最前面的两个不相同的元素，得到的就是最长的美丽数组。然后用总长度减去该长度即为答案。还有
October1_leetcode.cpp Palindrom.cpp Print.py Prob_C.cpp README.md ReverseNumber.java SelectionSort.cpp Simpleform.html SparseMatrix.cpp StructuredArray.cpp Sum_complex_number.py Swaping.py The Coin change prob solution ThreeSumZero.java