CodeWars:Sum of odd numbers
2017-10-11 21:54
309 查看
题目:
我的解:
个人觉得最棒解:
public static long rowSumOddNumbers(long n) { return n * n * n; }理由:
((n - 1) * n + 1) * n + (n - 1) * n
==>n * n * n
相关文章推荐
- [Haskell] CodeWars|Sum of odd numbers
- 面试题03:Sum of odd numbers
- Sum of Consecutive Prime Numbers ]
- POJ 2739 Sum of Consecutive Prime Numbers
- poj 2739 Sum of Consecutive Prime Numbers
- POJ 2739 Sum of Consecutive Prime Numbers(素数表的应用)
- To find sum of two numbers without using any operator. Only use of printf() is allowed.
- LeetCode.50(69\367\633) Pow(x,n)&&Sqrt(x)&&Valid Perfect Square&&Sum of Square Numbers
- poj 2739 Sum of Consecutive Prime Numbers(暴力+打表)
- POJ - 2739 Sum of Consecutive Prime Numbers(尺取法)
- POJ2739 Sum of Consecutive Prime Numbers
- POJ2739——DFS——Sum of Consecutive Prime Numbers
- poj 2379 Sum of Consecutive Prime Numbers
- C - Sum of Consecutive Prime Numbers(1.2.2)
- Sum of Consecutive Prime Numbers
- POJ 2739 Sum of Consecutive Prime Numbers
- Sum All Odd Fibonacci Numbers
- Sum of Consecutive Prime Numbers(POJ 2739)
- POJ 2739 Sum of Consecutive Prime Numbers(素数打表水题)
- Sum of Consecutive Prime Numbers(尺取,打表)