算法
-phoenix
凤凰鸣矣,于彼高岗;梧桐生矣,于彼朝阳。
展开
-
LeetCode Average of Levels in Binary Tree问题
Given a non-empty binary tree, return the average value of the nodes on each level in the form of an array.Example 1:Input: 3 / \ 9 20 / \ 15 7Output: [3, 14.5, 11]Explanat原创 2018-04-03 13:12:55 · 160 阅读 · 0 评论 -
LeetCode Custom Sort String 问题
题目是这样的:S and T are strings composed of lowercase letters. In S, no letter occurs more than once.S was sorted in some custom order previously. We want to permute the characters of T so that原创 2018-03-07 15:50:38 · 184 阅读 · 0 评论 -
LeetCode Next Greater Element I 问题
You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1's elements in the corresponding places of nums原创 2018-01-17 15:20:35 · 200 阅读 · 0 评论 -
LeetCode Island Perimeter问题
You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. Grid cells are connected horizontally/vertically (not diagonally). The grid is completely原创 2018-01-17 11:21:15 · 169 阅读 · 0 评论 -
LeetCode Reshape the Matrix
In MATLAB, there is a very useful function called 'reshape', which can reshape a matrix into a new one with different size but keep its original data.You're given a matrix represented by a two-dimen原创 2018-01-16 18:06:33 · 150 阅读 · 0 评论 -
括号匹配算法的java实现
public static void main(String[] args) { String str = "([])"; String st3 = "([)]"; String str2 = "(([]){})"; String st = "()[]{}"; String sttt ="]"; String sssss = "){"; System.out.print原创 2017-10-26 17:07:30 · 704 阅读 · 0 评论 -
动态规划(DP)算法
今天玩LeetCode的时候遇到了一道动态规划的题,题目是这样的:Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4],原创 2017-11-01 16:21:01 · 1854 阅读 · 0 评论 -
两个二进制数相加后得到新的二进制数
public static void main(String[] args) { String str1 = "1010"; String str2 = "1011"; System.out.println(addBinary(str1,str2)); } public static String addBinary(String a, String b) { if(a原创 2017-10-31 16:03:12 · 2034 阅读 · 0 评论 -
删除数组中重复的元素
public static void main(String[] args) { int nums[] = {1,1,1,2,3,4}; int nums2[] = {1,1,1}; int numw[] = {1,1,2}; System.out.println(removeDuplicates(numw)); } public static int removeDupl原创 2017-10-30 10:47:56 · 594 阅读 · 0 评论 -
判断数字是否是回文数
public static void main(String[] args) { int val = 121; System.out.println(isPalindrome(val)); } public static boolean isPalindrome(int x) { if (x<0 || (x!=0 && x%10==0)) return false;原创 2017-10-27 14:22:33 · 216 阅读 · 0 评论 -
将数组中指定的数字删除
public static void main(String[] args) { int nums[] = {3,2,2,3}; int val = 3; System.out.println(removeElement(nums,val)); } public static int removeElement(int[] nums, int val) { int leng原创 2017-10-27 13:35:29 · 2378 阅读 · 0 评论 -
数组中寻找插入位置算法
public static void main(String[] args) { int[] nums = {1}; System.out.println(searchInsert(nums ,1)); } public static int searchInsert(int[] nums, int target) { int flag = 0; for(int i=0;i原创 2017-10-27 10:20:30 · 533 阅读 · 0 评论