Jon_Snow3-CSDN博客

原创 leetcode 561

题目：Given an array of 2n integers, your task is to group these integers into n pairs of integer, say (a1, b1), (a2, b2), …, (an, bn) which makes sum of min(ai, bi) for all i from 1 to n as large as poss

2017-04-27 16:42:23 1120

原创 Java-String 反转

StringBuffer:有直接函数reverse()直接进行反转；举个简单例子--将一个数字反转并判断是否为回文，即是否将此数反转所的值与原值相同public class Demo { public static void main(String args[]){ int a = 12345; String s = String.valueOf(a);//将数字变为字符串

2017-04-26 17:05:21 539

原创 LeetCode/TwoSum Java

题目：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, and you may not use the same

2017-04-26 16:16:45 442

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人