LeetCode
a2615381
这个作者很懒,什么都没留下…
展开
-
LeetCode-Jewels and Stones java 宝石计算
You're given strings J representing the types of stones that are jewels, and S representing the stones you have. Each character in S is a type of stone you have. You want to know how many of the sto...原创 2018-04-19 15:55:59 · 357 阅读 · 0 评论 -
LeetCode -Reverse Integer 数字反转
Input: 123Output: 321解题思路通过%10得到个位数大小 例如 326得到 6然后将输入的数字/10带入继续循环 例如 326 =>32然后将 之前 %10的数字 X10+现在%10的个位数 例如 32得到2,然后 6*10+2=62反复循环即可翻转数字了, INT可能会出现数组越界 失真,最好使用 long类型 public i...原创 2018-04-05 23:06:54 · 219 阅读 · 0 评论 -
561. Array Partition I 分区阵列
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...原创 2018-04-19 16:44:51 · 252 阅读 · 0 评论 -
LeetCode-189. Rotate Array
Rotate an array of n elements to the right by k steps.For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to [5,6,7,1,2,3,4].Note:Try to come up as many solutions as you can, there...原创 2018-04-20 15:31:13 · 251 阅读 · 0 评论 -
LeetCode-415. Add Strings
Given two non-negative integers num1 and num2 represented as string, return the sum of num1 and num2.Note:The length of both num1 and num2 is < 5100.Both num1 and num2 contains only digits 0-9.Both...原创 2018-04-20 16:47:43 · 265 阅读 · 0 评论