Given an integer array nums of 2n integers, group these integers into n pairs (a1, b1), (a2, b2), …, (an, bn) such that the sum of min(ai, bi) for all i is maximized. Return the maximized sum.
思路 这道题要使得各最小值相加最小,就要使得的每一组…
Given a string s which consists of lowercase or uppercase letters, return the length of the longest palindrome that can be built with those letters. Letters are case sensitive, for example, “Aa” is not considered a palindrome here.
思路 首先学习一个新单…
Python里读取txt文件的方法有很多,但numpy读取字符串比较困难,这时可以考虑使用csv库,读取txt文件中的每一行文本。
代码
data []
with open(*******.txt, rt) as csvfile:reader csv.reader(csvfile, delimiter,)for row in reader:data…
Given an integer numRows, return the first numRows of Pascal’s triangle. In Pascal’s triangle, each number is the sum of the two numbers directly above it as shown:
前几天做的动态规划题好难呜呜,做道水题找回自信~
状态转移方程 triangle[i][j] …