sky527759的博客

description: 124. Binary Tree Maximum Path Sum Hard 7460 460 Add to List Share A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting them. A node can only appear in the sequence at most

description: https://leetcode.com/problems/intersection-of-two-linked-lists/ code.1: /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Soluti

description: 191. Number of 1 Bits Easy 649 478 Add to List Share Write a function that takes an unsigned integer and return the number of '1' bits it has (also known as the Hamming weight). Example...

description: 190. Reverse Bits Easy 821 306 Add to List Share Reverse bits of a given 32 bits unsigned integer. Example 1: Input: 00000010100101000001111010011100 Output: 001110010111100000101001010...

description: 7. Reverse Integer Easy 2949 4654 Add to List Share Given a 32-bit signed integer, reverse digits of an integer. Example 1: Input: 123 Output: 321 Example 2: Input: -123 Output: -321 ...

description: 17. Letter Combinations of a Phone Number Medium 2969 357 Add to List Share Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number ...

description: 260. Single Number III Medium 1088 86 Add to List Share Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. ...

description: Given an array containing n distinct numbers taken from 0, 1, 2, ..., n, find the one that is missing from the array. Example 1: Input: [3,0,1] Output: 2 Example 2: Input: [9,6,4,2,3,5...

description: Given a non-empty array of integers, every element appears three times except for one, which appears exactly once. Find that single one. Note: Your algorithm should have a linear runtim...

description: Given a non-empty array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a linear runtime complexity. Could you implement ...

code: func numSquares(n int) int { if n <= 0 { return 0 } //refer to Lagrange's Four-square Theorem, thk for Euler //if n % 4 == 0 then it can be divide by 4 f...

code: /* // Definition for a Node. class Node { public: int val; Node* next; Node* random; Node() {} Node(int _val, Node* _next, Node* _random) { val = _val; next...

code: /** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode * } */ func removeNthFromEnd(head *ListNode, n int) *ListNode { i, listRet, temp1 :...

code: /** * Definition for singly-linked list. * type ListNode struct { * Val int * Next *ListNode * } */ func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode { if nil == l1 { ...

code: func firstMissingPositive(nums []int) int { nLen := len(nums) if 0 == nLen { return 1 } for i, _ := range nums { for nums[i] != i + 1 && nums[i]...

code: func threeSum(nums []int) [][]int { nLen := len(nums) if nLen < 3 { return nil } var anRet [][]int //fmt.Printf("anRet:%p, %v, Len:%d, Cap:%d\n", anRet, anRet...

code: func isPalindrome(x int) bool { if x < 0 { return false } else if x < 10 { return true } else { //get The number of digits of the integer //2^64...

code: func longestPalindrome(s string) string { nLen := len(s) if 0 == nLen { return "" } /*with no thought of those characters that have many bytes, solve this probl...

code: func findMedianSortedArrays(nums1 []int, nums2 []int) float64 { /*from question : You may assume nums1 and nums2 cannot be both empty. */ /*assume nums1 and nums2 are both in order */ //e...

code: func lengthOfLongestSubstring(s string) int { if “” == s { return 0 } /*from internet, it should have 256 different characters. with no thought of those characters that have many bytes. */ var ...

code: /** Definition for singly-linked list. type ListNode struct { Val int Next *ListNode } */ func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode { if nil == l1 { return l2 } else i...

code: type KeyValue struct { Key int Value int } type ArrKV []KeyValue func (kvs ArrKV) Len() int { return len(kvs) } func (kvs ArrKV) Less(i, j int) bool { return kvs[i].Value < kvs[j].Valu...