
LeetCode
我就是我--不一样的烟火
这个作者很懒,什么都没留下…
展开
-
LeetCode 50.Pow(x, n)
public static double myPow(double x, int n) { if(n == 0) return 1; if(n < 0 ){ n = - n; x = 1 / x; } if(n == -2147483648) return原创 2017-07-02 11:20:33 · 328 阅读 · 0 评论 -
LeetCode 40.Combination Sum II
import java.util.ArrayList;import java.util.Arrays;import java.util.List;public class Test40 { public static void main(String[] args) { int[] candidates = {10, 1, 2, 7, 6, 1, 5}; System.out.原创 2017-06-27 15:39:14 · 435 阅读 · 0 评论 -
leetcode 34. Search for a Range
public class Test34 { public static void main(String[] args) { int[] nums = {8,8}; int[] a =searchRange(nums, 8); for(int i = 0; i < 2; i++) System.out.println(a[i]); } public static int原创 2017-06-26 10:38:06 · 424 阅读 · 0 评论