算法
qq_30035749
这个作者很懒,什么都没留下…
展开
-
1的个数
输入一个整数,输出该数二进制表示中1的个数。其中负数用补码表示。public class Solution { public int NumberOf1(int n) { int count=0; while(n!=0){ n=n&(n-1); count++; } r...原创 2019-03-14 21:16:17 · 195 阅读 · 0 评论 -
顺时针打印矩阵
顺时针打印矩阵import java.util.ArrayList;public class Solution { public ArrayList<Integer> printMatrix(int [][] matrix) { ArrayList<Integer> res=new ArrayList<Integer>(); ...原创 2019-05-09 16:31:23 · 113 阅读 · 0 评论 -
Maximize Distance to Closest Person
In a row of seats, 1 represents a person sitting in that seat, and 0 represents that the seat is empty.There is at least one empty seat, and at least one person sitting.Alex wants to sit in the seat...原创 2019-05-10 16:06:57 · 145 阅读 · 0 评论 -
Shifting Letters
We have a string S of lowercase letters, and an integer array shifts.Call the shift of a letter, the next letter in the alphabet, (wrapping around so that ‘z’ becomes ‘a’).For example, shift(‘a’) = ...原创 2019-05-10 20:18:06 · 153 阅读 · 0 评论 -
interleaving-string
Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2.For example,Given:s1 =“aabcc”,s2 =“dbbca”,When s3 =“aadbbcbcac”, return true.When s3 =“aadbbbaccc”, return false.pub...原创 2019-05-26 11:29:10 · 317 阅读 · 0 评论 -
add two numbers
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a link...原创 2019-05-27 10:40:15 · 111 阅读 · 0 评论 -
restore-ip-addresses
import java.util.*;public class Solution { public ArrayList<String> restoreIpAddresses(String s) { ArrayList<String> res=new ArrayList<String>(); String temp="";...原创 2019-05-28 00:26:15 · 104 阅读 · 0 评论 -
path-sum
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { publi...原创 2019-05-29 15:31:58 · 125 阅读 · 0 评论 -
unique-binary-search-trees-ii
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; left = null; right = null; } * } */import...原创 2019-05-29 17:42:05 · 160 阅读 · 0 评论 -
binary-tree-zigzag-level-order-traversal
/** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */import java.util.*;public class ...原创 2019-06-07 16:24:11 · 136 阅读 · 0 评论 -
longest-palindromic-substring
public class Solution { int max=0; int start=0; public String longestPalindrome(String s) { if(s.length()<2){ return s; } for(int i=0;i<s.leng...原创 2019-06-07 20:14:20 · 227 阅读 · 0 评论 -
minimum-path-sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at an...原创 2019-06-03 14:02:10 · 106 阅读 · 0 评论 -
remove-duplicates-from-sorted-list and gray-code and reverse-linked-list-ii and remove-duplicates-f
删除链表中重复的结点/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * }...原创 2019-06-10 10:13:58 · 136 阅读 · 0 评论 -
二叉树转双向链表
输入一棵二叉搜索树,将该二叉搜索树转换成一个排序的双向链表。要求不能创建任何新的结点,只能调整树中结点指针的指向。public class Solution { private TreeNode leftHead=null; private TreeNode rightHead=null; public TreeNode Convert(TreeNode pRootOfT...原创 2019-05-09 15:12:12 · 133 阅读 · 0 评论 -
重建二叉树
输入某二叉树的前序遍历和中序遍历的结果,请重建出该二叉树。假设输入的前序遍历和中序遍历的结果中都不含重复的数字。例如输入前序遍历序列{1,2,4,7,3,5,6,8}和中序遍历序列{4,7,2,1,5,3,8,6},则重建二叉树并返回。/** * Definition for binary tree * public class TreeNode { * int val; * ...原创 2019-05-09 11:07:39 · 86 阅读 · 0 评论 -
数组中数字出现的次数
统计一个数字在排序数组中出现的次数。public class Solution { public int GetNumberOfK(int [] array , int k) { int start=0; int end=array.length-1; if((end==0)&&(k==array[0])) ...原创 2019-03-14 23:24:54 · 984 阅读 · 0 评论 -
字符串价值
import java.util.*;public class Main{ public static void main(String args[]){ Scanner sc=new Scanner(System.in); int a2z[]=new int[26]; char line[]=sc.nextLine().toCharArr...原创 2019-03-15 00:16:36 · 252 阅读 · 0 评论 -
六一儿童节
六一儿童节,老师带了很多好吃的巧克力到幼儿园。每块巧克力j的重量为w[j],对于每个小朋友i,当他分到的巧克力大小达到h[i] (即w[j]>=h[i]),他才会上去表演节目。老师的目标是将巧克力分发给孩子们,使得最多的小孩上台表演。可以保证每个w[i]> 0且不能将多块巧克力分给一个孩子或将一块分给多个孩子。import java.util.*;public class Main...原创 2019-03-11 09:42:30 · 454 阅读 · 0 评论 -
大整数乘法
有两个用字符串表示的非常大的大整数,算出他们的乘积,也是用字符串表示。不能用系统自带的大整数类型。import java.util.*;public class Main{ public static void main(String args[]){ Scanner sc=new Scanner(System.in); String ...原创 2019-03-11 15:25:46 · 194 阅读 · 0 评论 -
删除重复字符
牛牛有一个由小写字母组成的字符串s,在s中可能有一些字母重复出现。比如在"banana"中,字母’a’和字母’n’分别出现了三次和两次。但是牛牛不喜欢重复。对于同一个字母,他只想保留第一次出现并删除掉后面出现的字母。请帮助牛牛完成对s的操作import java.util.*;public class Main{ public static void main(String args...原创 2019-03-11 19:40:52 · 279 阅读 · 0 评论 -
最小k个数
import java.util.*;public class Solution { public ArrayList<Integer> GetLeastNumbers_Solution(int [] input, int k) { ArrayList<Integer> list=new ArrayList<Integer>(); ...原创 2019-03-24 18:22:31 · 167 阅读 · 0 评论 -
Convert BST to Greater Tree
题目描述:Given a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus sum of all keys greater than the original key in BST.I...原创 2019-03-26 10:36:29 · 113 阅读 · 0 评论 -
Hamming distance
The Hamming distance between two integers is the number of positions at which the corresponding bits are different.class Solution(object): def hammingDistance(self, x, y): """ :ty...原创 2019-03-26 10:40:31 · 193 阅读 · 0 评论 -
Path Sum III
You are given a binary tree in which each node contains an integer value.Find the number of paths that sum to a given value.The path does not need to start or end at the root or a leaf, but it must ...原创 2019-03-26 11:06:39 · 106 阅读 · 0 评论 -
反转链表
/*public class ListNode { int val; ListNode next = null; ListNode(int val) { this.val = val; }}*/public class Solution { public ListNode ReverseList(ListNode head) { ...原创 2019-03-26 11:13:13 · 107 阅读 · 0 评论 -
MinStack
class MinStack: def __init__(self): """ initialize your data structure here. """ self.stack=[] def push(self, x: int) -> None: if(not self.stack):...原创 2019-03-26 11:23:03 · 131 阅读 · 0 评论 -
合并k个有序链表
# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclass Solution: def mergeKLists(self, lists: List[ListNode]) ...原创 2019-03-26 11:46:54 · 199 阅读 · 0 评论 -
Median of Two Sorted Arrays
There are two sorted arrays nums1 and nums2 of size m and n respectively.Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).You may assume nums1 and num...原创 2019-03-26 12:06:18 · 107 阅读 · 0 评论 -
Palindrome Linked List
Given a singly linked list, determine if it is a palindrome.# Definition for singly-linked list.# class ListNode:# def __init__(self, x):# self.val = x# self.next = Noneclas...原创 2019-03-26 14:51:07 · 100 阅读 · 0 评论 -
leetcode pathSum3
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object): d...原创 2019-04-19 21:12:53 · 229 阅读 · 0 评论 -
convert-sorted-array-to-binary-search-tree
Given an array where elements are sorted in ascending order, convert it to a height balanced BST./** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * ...原创 2019-06-04 00:10:19 · 106 阅读 · 0 评论