San Song Daddy :)

当下，耶稣从加利利来到约旦河，见了约翰，要受他的洗。 (马太福音 3:13 和合本) Then Jesus came from Galilee to the Jordan to be baptized by John. (Matthew 3:13 NIV) 约翰想要拦住他，说："我当受你的洗，你反倒上我这里来吗？" (马太福音 3:14 和合本) But John tried to deter him, saying, "I need to be baptized by you, and do you come to me?" (Matthew 3:14 NIV) 耶稣回答说："你暂且许我，因为我们理当这样尽诸般的义（或译：礼） 。"于是约翰许了他。 (马太福音 3:15 和合本) Jesus replied, "Let it be so now; it is proper for us to do this to fulfill all righteousness."Then John consented. (Matthew 3:15 NIV) 耶稣受了洗，随即从水里上来。天忽然为他开了，他就看见　神的灵仿佛鸽子降下，落在他身上。 (马太福音 3:16 和合本) As soon as Jesus was baptized, he went up out of the water. At that moment heaven was opened, and he saw the Spirit of God descending like a dove and alighting on him. (Matthew 3:16 NIV) 从天上有声音说："这是我的爱子，我所喜悦的。" (马太福音 3:17 和合本) And a voice from heaven said, "This is my Son, whom I love; with him I am well pleased." (Matthew 3:17 NIV) Photo by Simon Matzinger / Unsplash

"只是我告诉你们这听道的人，你们的仇敌，要爱他！恨你们的，要待他好！ (路加福音 6:27 和合本) "But to you who are listening I say: Love your enemies, do good to those who hate you, (Luke 6:27 NIV) 咒诅你们的，要为他祝福！凌辱你们的，要为他祷告！ (路加福音 6:28 和合本) bless those who curse you, pray for those who mistreat you. (Luke 6:28 NIV) 有人打你这边的脸，连那边的脸也由他打。有人夺你的外衣，连里衣也由他拿去。 (路加福音 6:29 和合本) If someone slaps you on one cheek, turn to them the other also. If someone takes your coat, do not withhold your shirt from them. (Luke 6:29 NIV) 凡求你的，就给他。有人夺你的东西去，不用再要回来。 (路加福音 6:30 和合本) Give to everyone who asks you, and if anyone takes what belongs to you, do not demand it back. (Luke 6:30 NIV) 你们愿意人怎样待你们，你们也要怎样待人。 (路加福音 6:31 和合本) Do to others as you would have them do to you. (Luke 6:31 NIV) Photo by Artem Sapegin / Unsplash

想望耶和华日子来到的有祸了！你们为何想望耶和华的日子呢？那日黑暗没有光明， (阿摩司书 5:18 和合本) Woe to you who long for the day of the Lord ! Why do you long for the day of the Lord ? That day will be darkness, not light. (Amos 5:18 NIV) 景况好像人躲避狮子又遇见熊，或是进房屋以手靠墙，就被蛇咬。 (阿摩司书 5:19 和合本) It will be as though a man fled from a lion only to meet a bear, as though he entered his house and rested his hand on the wall only to have a snake bite him. (Amos 5:19 NIV) 耶和华的日子不是黑暗没有光明吗？不是幽暗毫无光辉吗？ (阿摩司书 5:20 和合本) Will not the day of the Lord be darkness, not light— pitch-dark, without a ray of brightness? (Amos 5:20 NIV) Photo by Anton Romanov / Unsplash

他带我回到殿门，见殿的门槛下有水往东流出（原来殿面朝东）。这水从槛下，由殿的右边，在祭坛的南边往下流。 (以西结书 47:1 和合本) The man brought me back to the entrance to the temple, and I saw water coming out from under the threshold of the temple toward the east (for the temple faced east). The water was coming down from under the south side of the temple, south of the altar. (Ezekiel 47:1 NIV) 他带我出北门，又领我从外边转到朝东的外门，见水从右边流出。 (以西结书 47:2 和合本) He then brought me out through the north gate and led me around the outside to the outer gate facing east, and the water was trickling from the south side. (Ezekiel 47:2 NIV) 他手拿准绳往东出去的时候，量了一千肘，使我趟过水，水到踝子骨。 (以西结书 47:3 和合本) As the man went eastward with a measuring line in his hand, he measured off a thousand cubits and then led me through water that was ankle-deep. (Ezekiel 47:3 NIV) 他又量了一千肘，使我趟过水，水就到膝；再量了一千肘，使我趟过水，水便到腰； (以西结书 47:4 和合本) He measured off another thousand cubits and led me through water that was knee-deep. He measured off another thousand and led me through water that was up to th

Question: http://www.lintcode.com/en/problem/wiggle-sort-ii/ Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3].... Answer: class Solution { public: /* * @param nums: A list of integers * @return: nothing */ inline int partion(vector<int> &nums, int left, int right) { int pivot = nums[left]; int i = left - 1; int j = right + 1; while (1) { do { i = i + 1; } while (nums[i] < pivot); do { j = j -1; } while (nums[j] > pivot); if (i >= j) return j; int temp = nums[i]; nums[i] = nums[j]; nums[j] = temp; } } inline void qsort(vector<int> &nums, int left, int right) { if (left >= right) return; int p = partion(nums, left, right);

耶和华的灵（原文是手） 降在我身上。耶和华藉他的灵带我出去，将我放在平原中；这平原遍满骸骨。 (以西结书 37:1 和合本) The hand of the Lord was on me, and he brought me out by the Spirit of the Lord and set me in the middle of a valley; it was full of bones. (Ezekiel 37:1 NIV) 他使我从骸骨的四围经过，谁知在平原的骸骨甚多，而且极其枯干。 (以西结书 37:2 和合本) He led me back and forth among them, and I saw a great many bones on the floor of the valley, bones that were very dry. (Ezekiel 37:2 NIV) 他对我说："人子啊，这些骸骨能复活吗？"我说："主耶和华啊，你是知道的。" (以西结书 37:3 和合本) He asked me, "Son of man, can these bones live?" I said, "Sovereign Lord , you alone know." (Ezekiel 37:3 NIV) 他又对我说："你向这些骸骨发预言说：枯干的骸骨啊，要听耶和华的话。 (以西结书 37:4 和合本) Then he said to me, "Prophesy to these bones and say to them, 'Dry bones, hear the word of the Lord ! (Ezekiel 37:4 NIV) 主耶和华对这些骸骨如此说：'我必使气息进入你们里面，你们就要活了。 (以西结书 37:5 和合本) This is what the Sovereign Lord says to these bones: I will make breath enter you, and you will come to life. (Ezekiel 37:5 NIV)

Question: http://www.lintcode.com/en/problem/wiggle-sort/ Given an unsorted array nums, reorder it in-place such that nums[0] <= nums[1] >= nums[2] <= nums[3].... Example Given nums = [3, 5, 2, 1, 6, 4], one possible answer is [1, 6, 2, 5, 3, 4]. Answer: class Solution { public: /* * @param nums: A list of integers * @return: nothing */ inline int partion(vector<int> &nums, int left, int right) { int pivot = nums[left]; int i = left - 1; int j = right + 1; while (1) { do { i = i + 1; } while (nums[i] < pivot); do { j = j -1; } while (nums[j] > pivot); if (i >= j) return j; int temp = nums[i]; nums[i] = nums[j]; nums[j] = temp; } } inline void qsort(vector<int> &nums, int left, int right) { if (left >= right)