寒沨的博客

数据结构--单链表在数据结构中 链表学习最为基础

Problem：Given a (singly) linked list with head node root, write a function to split the linked list into k consecutive linked list "parts".The length of each part should be as equal as possible: no tw...

Problem:Given a non negative integer number num. For every numbers i in the range 0 ≤ i ≤ num calculate the number of 1's in their binary representation and return them as an array.Example:For num = 5...

Problem：Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division and i...

Problem：Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.You should try to do i...

Given a linked list, remove the n-th node from the end of list and return its head.Example:Given linked list: 1->2->3->4->5, and n = 2.After removing the second node from the end, the li...

Problem：Reverse a linked list from position m to n. Do it in one-pass.Note: 1 ≤ m ≤ n ≤ length of list.Example:Input: 1->2->3->4->5->NULL, m = 2, n = 4Output: 1->4->3->2->5...

Problem：Given a singly linked list, determine if it is a palindrome.Follow up:Could you do it in O(n) time and O(1) space?题目：给定一个单链表，判断是否为回文?最好时间复杂度O(n)，空间复杂度为 O(1)。 思路：除去要求，最简单的方法则是用stack...

1，数组操作中，可以使用等于（=）赋值，注意：此时新数组只是指向原数组的存储空间，并没有重新申请新的空间。2，第二种使用System.ararycopy方法System.arraycopy(originalArray, 0, targetArray, 0, originalArray.length);此时，新数组重新申请存储地址空间，再将原数组中数据拷贝过来。...

字典树又称为前缀树或Trie树，是处理字符串常见的数据结构。假设组成所有单词的字符仅为a-z。字典树介绍字典树是一种树形结构，优点是利用字符串的公共前缀来节约存储空间，比如加入"abc"、“abcd”、“abd”、“b”、“bcd”、“efg”、"hik"之后，字典树如图所示。基本特性根节点没有字符路径。除了根节点外，每一个节点都被一个字符路径找到。从根节点到某一节点，将路径上经过的...

HashMap源码分析继承和接口静态变量关键方法1. hashCode()2. equals()3. hash()继承和接口继承AbstractMap.java实现接口Map，Cloneable，Serializable静态变量初试容量默认是16 -必须是2的次方 /** * The default initial capacity - MUST be a ...

Problem：Given a sorted array nums, remove the duplicates in-place such that duplicates appeared at most twice and return the new length.Do not allocate extra space for another array, you must do this ...

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.Example 1:Input: 1->2->3->3->4->4->5Output: 1->2-&g...

借用栈实现单链表逆向倒序输出

斐波那契数列实用解法，时间复杂度为O(n)

题目：求平方根。。。必须返回的是整数，就是小数点要舍弃。思路：直接用轮子。。。sqrt()代码：class Solution {    public int mySqrt(int x) {        return (int)Math.sqrt(x);    }}...

Problem:The Hamming distance between two integers is the number of positions at which the corresponding bits are different.Given two integers x and y, calculate the Hamming distance.题目：求汉明距离，即两个数不同位数的...

Problem:Given an array of integers where 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once.Find all the elements of [1, n] inclusive that do not appear in this array....

Problem:You're given strings J representing the types of stones that are jewels, and S representing the stones you have.  Each character in Sis a type of stone you have.  You want to know how many of ...

Problem: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...

Problem：Given a string S and a character C, return an array of integers representing the shortest distance from the character C in the string.题目：给定一个字符串S和字符C，返回一个整型数组，数组每一位表示字符串对应下标位字符距离C字符的最短距离。思路：首先...

Problem：Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -.Example:Given a = 1 and b = 2, return 3.题目：计算a和b的和，不使用加减运算符。思路：使用异或，与等逻辑运算。（参考计算机组成原理中补码加减法等）使用异或...

Problem:Given a string, find the length of the longest substring without repeating characters.Examples:Given "abcabcbb", the answer is "abc", which the length is 3.Given "bbbbb", the answer is "b", wi...

两篇介绍的不错的文章，先记录下https://www.cnblogs.com/mafeng/p/7908620.htmlhttps://www.cnblogs.com/LBSer/p/3392491.html