初级编程通关练习题 #18 – 离坐标中心最近的N个点
给定一组平面坐标集合S，找出这些坐标中距离中心点（0，0）距离最近的N个点列表，N大于1小于坐标集合的长度。 输入样例： S = [[4, 1], [6, 3], [5, -2], [-1, 4], [3, -3], [-2, -4], [1, 1]] N = 3 输出样例： [[1, 1], [4, 1], [-1, 4]] 上面的输入样例中，距离坐标中心点最近的三个点是 [1,…
Data Structure & Algorithm: Level-1 Problem #64. Permutation and Combination -2
Given a list of N (6 < N < 10) positive integers. Using one integer as the lead number and times 10N-1 to get a threshhold value. Find out how…
Data Structure & Algorithm: Level-1 Problem #34. Merging Binary Trees
Given two binary trees, merge them together using the following guidelines: For overlapping nodes, sum the weight together as the weight of the new node.For non-overlapping nodes, add the not…
Data Structure & Algorithm: Level-1 Problem #33. Build Binary Tree
Given a list of integers, build a complete binary tree using the list as its node weight. Note that a complete binary tree is a binary tree in which every…
Data Structure & Algorithm: Level-1 Problem #32. Complete Binary Tree
A complete binary tree is a binary tree in which every level, except possibly the last, is completely filled, and all nodes are as far left as possible. A complete…
Data Structure & Algorithm: Level-1 Problem #31. Dvorak Keyboard
Dvorak keyboard layout is different from the default QWERT keyboard we used everyday. It's a faster and more ergonomic alternative to the QWERTY layout. Dvorak proponents claim that it requires…
Data Structure & Algorithm: Level-1 Problem #30. Nearest Divisors
Given a integer, find out its nearest pair of divisors. Sample Input: 28 Sample Output: [4, 7] With the number of 28, there are three pairs of divisors: [1, 28],…
Data Structure & Algorithm: Level-1 Problem #29. Leaves Weight
Given a binary tree, each node has a weight. A leave note is a one without any child node. Find out the total weight of all the right leaves. For…
Data Structure & Algorithm: Level-1 Problem #28. Longest Palindrome
Given a string with lowercase or uppercase letters, return the length of the longest palindrome that can be built with those letters. Note that letters are case sensitive, for example,…
Data Structure & Algorithm: Level-1 Problem #27. Moving Zeroes
Given a list of integers, move all zeroes to the end of the list while maintaining the relative order of the non-zero numbers. Note that you must do this in-place…