算法练习
TarucaLiu
这个作者很懒,什么都没留下…
展开
-
191. Number of 1 Bits#1(Done)
Solution#1(2ms)public class Solution { // you need to treat n as an unsigned value public int hammingWeight(int n) { int count = 0; while (n != 0) { n = n & (n - 1);原创 2017-03-07 21:11:00 · 155 阅读 · 0 评论 -
409. Longest Palindrome#2(Done)
Solutionpublic class Solution { public int longestPalindrome(String s) { int[] table = new int[52]; for (int i = 0; i < s.length(); i++) { if (s.charAt(i) - 'a' >= 0) {原创 2016-12-28 11:41:17 · 129 阅读 · 0 评论 -
438. Find All Anagrams in a String#3(Done)
Solutionpublic class Solution { public List<Integer> findAnagrams(String s, String p) { List<Integer> result = new ArrayList<>(); int[] table = new int[26]; int pLength = p.原创 2016-12-27 21:11:46 · 162 阅读 · 0 评论 -
447. Number of Boomerangs#2(Done)
Solution#1Problem#1map的用法,getOrDefault(key, default),遍历方法原创 2017-01-03 20:21:58 · 142 阅读 · 0 评论 -
404. Sum of Left Leaves#2(Done)
Solution#2/** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ // 递归public cl原创 2017-01-03 16:27:24 · 132 阅读 · 0 评论 -
18. 4Sum#1
Solution#1 Problem#1 * 先做简单的原创 2016-12-28 17:28:34 · 142 阅读 · 0 评论 -
202. Happy Number#2(Done)
Solutionpublic class Solution { public boolean isHappy(int n) { HashSet<Integer> set = new HashSet<Integer>(); int s = 0; while(!set.contains(n)) { set.add(n);原创 2016-12-26 18:34:23 · 178 阅读 · 0 评论 -
49. Group Anagrams#1
Solutionpublic class Solution { public List<List<String>> groupAnagrams(String[] strs) { List<List<String>> list = new ArrayList<>(); if (strs == null || strs.length == 0) return li原创 2016-12-28 14:03:31 · 199 阅读 · 0 评论 -
383. Ransom Note#1(Done)
Solution#1public class Solution { public boolean canConstruct(String ransomNote, String magazine) { int[] table = new int[26]; // char[] mc = magezine.toCharArray(); for (ch原创 2017-01-03 11:59:28 · 308 阅读 · 0 评论 -
448. Find All Numbers Disappeared in an Array#2(Done)
Solution#1public class Solution { public List<Integer> findDisappearedNumbers(int[] nums) { List<Integer> list = new ArrayList<>(); if (nums == null || nums.length == 0) return list原创 2017-01-01 17:44:20 · 136 阅读 · 0 评论 -
463. Island Perimeter#1(Done)
Solutionpublic class Solution { public int islandPerimeter(int[][] grid) { int[] type = new int[5]; int length = grid.length; int width = grid[0].length; for (int i原创 2016-12-14 20:36:30 · 155 阅读 · 0 评论 -
290. Word Pattern#2(Done)
Solutionpublic class Solution { public boolean wordPattern(String pattern, String str) { HashMap<Character, String> map = new HashMap<Character, String>(); char[] cArray = pattern.t原创 2016-12-11 20:33:46 · 160 阅读 · 0 评论 -
204. Count Primes#1
Solutionpublic class Solution { public int countPrimes(int n) { if (n <= 1) return 0; HashSet<Integer> set = new HashSet<Integer>(); int result = 0; for (int i = 2;原创 2016-12-16 22:02:30 · 125 阅读 · 0 评论 -
205. Isomorphic Strings#1(Done)
Solutionpublic class Solution { public boolean isIsomorphic(String s, String t) { if (s == null || t == null) { return false; } int[] array = new int[512];原创 2016-12-16 17:18:26 · 136 阅读 · 0 评论 -
20_Valid Parentheses徒手尝试#2(Done)
validParentheses原创 2016-11-27 21:03:28 · 168 阅读 · 0 评论 -
19_Remove Nth Node From End of List徒手尝试#2(Done)
19_Remove Nth Node From End of List徒手尝试#2原创 2016-11-27 18:49:09 · 179 阅读 · 0 评论 -
414. Third Maximum Number#2(Done)
Solution#1public class Solution { public int thirdMax(int[] nums) { int[] top = new int[3]; for (int i = 0; i < 3; i++) { top[i] = Integer.MIN_VALUE; } i原创 2016-12-28 21:42:56 · 140 阅读 · 0 评论 -
387. First Unique Character in a String#2(Done)
Solution#1public class Solution { public int firstUniqChar(String s) { if (s == null || s.length() == 0) return -1; int[] position = new int[26]; for (int i = 0原创 2017-01-03 22:08:28 · 181 阅读 · 0 评论 -
401. Binary Watch#1(Done)
Solution#1public class Solution { public List<String> readBinaryWatch(int num) { if (num < 0 || num > 10) throw new IllegalArgumentException("the argument for readBinaryWatch is原创 2017-01-08 16:28:58 · 269 阅读 · 0 评论 -
501. Find Mode in Binary Search Tree#2
Solution#1 Problem#1 1. 没什么想法 2. int不能为null,但是Integer可以 3. Integer初始化是考虑是否置null原创 2017-03-02 19:39:02 · 207 阅读 · 0 评论 -
434. Number of Segments in a String#1
Solution#1public class Solution { public int countSegments(String s) { if (s == null || s == 0) return 0; char[] c = s.toCharArray(); int i = 0; int count = 0;原创 2017-03-20 21:56:09 · 143 阅读 · 0 评论 -
268. Missing Number#1(Done)
Solution#2public class Solution { public int missingNumber(int[] nums) { int i = 0; int result = 0; while (i < nums.length) { result = result ^ i ^ nums[i];原创 2017-03-02 17:04:25 · 212 阅读 · 0 评论 -
541. Reverse String II#1
Solutionpublic class Solution { public String reverseStr(String s, int k) { if (s == null || s.length() == 0) return s; char[] c = s.toCharArray(); int times = c原创 2017-03-20 14:02:00 · 284 阅读 · 0 评论 -
344. Reverse String#1
Solution#1public class Solution { public String reverseString(String s) { char[] ca = s.toCharArray(); int l = 0; int r = ca.length - 1; char tmp; while (l <原创 2017-03-20 10:49:28 · 164 阅读 · 0 评论 -
476. Number Complement#2
Solution#1public class Solution { public int findComplement(int num) { int tmp = num; int count = 0; while (tmp != 0) { tmp = tmp >> 1; count++;原创 2017-03-07 21:47:52 · 152 阅读 · 0 评论 -
122. Best Time to Buy and Sell Stock II(Done)
Solution#1public class Solution { public int maxProfit(int[] prices) { if (prices == null || prices.length == 0) return 0; int profit = 0; for (int i = 1; i < pr原创 2017-03-08 16:28:07 · 191 阅读 · 0 评论 -
53. Maximum Subarray#1
Solution#1public class Solution { public int maxSubArray(int[] nums) { if (nums == null || nums.length == 0) return 0; int index = 0; int sum = 0; int max = Integer.M原创 2017-03-08 10:10:47 · 148 阅读 · 0 评论 -
35. Search Insert Position#1(Done)
Solution#2public class Solution { public int searchInsert(int[] nums, int target) { if (nums == null && nums.length == 0) return 0; return searchInsert(nums, target, 0, nums.length -原创 2017-03-02 21:36:57 · 158 阅读 · 0 评论 -
56. Merge Intervals#2(Done)
Solution#1Problem#1 1.不用类继承的方法不会写Comparator,这个概念还要搞懂 2.写得不熟练 3.List<Interval> result = new LinkedList<Interval>();比List<Interval> result = new LinkedList<>();快 4.第二种方法原创 2017-03-01 10:37:02 · 215 阅读 · 0 评论 -
453. Minimum Moves to Equal Array Elements#1(Done)
Solution#1public class Solution { public int minMoves(int[] nums) { int result = 0; int tmp = nums[0]; for (int i = 0; i < nums.length; i++) { if (tmp < nums[i])原创 2017-01-01 18:24:53 · 146 阅读 · 0 评论 -
437. Path Sum III#1
Solution#1 Problem#1*没有思路原创 2017-01-10 15:05:50 · 152 阅读 · 0 评论 -
459. Repeated Substring Pattern#2
Solution#1 Problem#1思路不清楚原创 2017-01-09 20:11:41 · 152 阅读 · 0 评论 -
405. Convert a Number to Hexadecimal#2
Solution#1 Problem#1试着用位操作去解决,而不是通过触发原创 2017-01-08 22:02:28 · 152 阅读 · 0 评论 -
415. Add Strings#1(Done)
Solution#1public class Solution { public String addStrings(String num1, String num2) { if (num1.equals("0")) return num2; if (num2.equals("0")) return num1;原创 2017-01-08 21:22:54 · 162 阅读 · 0 评论 -
160. Intersection of Two Linked Lists#1(Done)
Solution/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */原创 2016-12-09 20:32:47 · 112 阅读 · 0 评论 -
155. Min Stack#3(Done)
Solution Problem#1 * 完全没有概念,把栈,队列,背包的实现再熟悉一下原创 2016-12-06 21:48:21 · 172 阅读 · 0 评论 -
88. Merge Sorted Array#1(Done)
Solutionpublic class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { int i = m - 1; int j = n - 1; for (int k = m + n - 1; k >= 0; k--) {原创 2016-12-02 21:59:49 · 139 阅读 · 0 评论 -
83. Remove Duplicates from Sorted List#1(Done)
Solution/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */public class Solution { public ListNo原创 2016-12-02 21:25:53 · 126 阅读 · 0 评论 -
70. Climbing Stairs#1(Done)
Solutionpublic class Solution { public int climbStairs(int n) { if (n <= 1) { return 1; } return findWays(n); } public int findWays(int n) { if (n原创 2016-12-02 21:09:32 · 114 阅读 · 0 评论 -
67. Add Binary#1(Done)
Solutionpublic class Solution { public String addBinary(String a, String b) { if (a.length() > b.length()) { String tmp = a; a = b; b = tmp; }原创 2016-12-02 17:29:27 · 149 阅读 · 0 评论