Six ways to think like a journalist!

Journalists have the ability to state a thing more clearly. What can we learn from them to help us report or explain things like them?

There are six ways as follows:

1. Know your audience and adapt your voice accordingly (认清受众,相应调整声音)

Spend some time carefully defining who you want to read your content and figuring out their interests and behaviors.

2. Understand five determinants of "newsworthiness" (明白“新闻报道价值”的五个决定性因素)

Timing, Significance, Proximity, Prominence, Interest.

Proximity: Is the topic close enough to readers for it to pique their attention?

Prominence: Put simply, why should people care?

3. There are lots of facts, but only one core story (事实有很多,但核心只有一个)

Remenber that, as a content marketer, the first goal is storytelling.

Draw readers in with text that entertains them, gives them answers and makes them want to learn more, then close everything out with a conclusion that ties it all together and reinforces what you‘ve just said.

4.  Support your claims (支持你的说法)

No journalist would send his or her editor an article full of unsupported statements.

Beyond a credibility boost, supplementing what you say can also help readers make sense of more complex subjects.

5.  Package and Repackage your content (不断包装你的内容)

Quality content has potential beyond a single piece of text.

When you‘re brainstorming, try thinking about ideas in a broader sense.

6.  If you haven‘t done the necessary legwork, it‘s going to show (如果没有搜集工作,别人会知道的)

When someone choose to read your content, they‘re dedicating part of their day to checking out what you have to say.

Show them you value their time and they‘ll respond by coming back for more.

这六点其实告诉了我们在写文章或者在说话时要注意的地方。

首先,我们应该弄清楚我们的对象是谁,你不可能给一个艺术家去谈论你的科技问题吧

其次, 要明白意义,重要性,一些毫无意义的东西给读者看,那不是浪费人家时间

然后, 我们的精力是有限的,要有核心和重点,不能范谈,因为这样会让人看了半天不知所以然

再, 要有支持的观念,还要包装,就是举一反三,帮助更好地理解

最后, 一定要有积累,你都没有预先准备好,那写出来的东西会不会就很空洞呢!

时间: 2024-11-13 08:02:38

Six ways to think like a journalist!的相关文章

91. Decode Ways

原题目: A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given an encoded message containing digits, determine the total number of ways to decode it. For example,Given enc

HDU 1978 How many ways(记忆化)

Description 这是一个简单的生存游戏,你控制一个机器人从一个棋盘的起始点(1,1)走到棋盘的终点(n,m).游戏的规则描述如下: 1.机器人一开始在棋盘的起始点并有起始点所标有的能量. 2.机器人只能向右或者向下走,并且每走一步消耗一单位能量. 3.机器人不能在原地停留. 4.当机器人选择了一条可行路径后,当他走到这条路径的终点时,他将只有终点所标记的能量. 如上图,机器人一开始在(1,1)点,并拥有4单位能量,蓝色方块表示他所能到达的点,如果他在这次路径选择中选择的终点是(2,4)

[LeetCode] decode ways 解码方式

A message containing letters fromA-Zis being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given an encoded message containing digits, determine the total number of ways to decode it. For example,Given encoded me

LeetCode 241. Different Ways to Add Parentheses

241. Different Ways to Add Parentheses Add to List Description Submission Solutions Total Accepted: 38849 Total Submissions: 92740 Difficulty: Medium Contributors: Admin Given a string of numbers and operators, return all possible results from comput

091. Decode Ways

1 class Solution { 2 public: 3 int numDecodings(string s) { 4 if (s.size() == 0) return 0; 5 else { 6 vector<int> ways(s.size(), 0); 7 if (s[0] >= '1' && s[0] <= '9') ways[0] = 1; 8 else ways[0] = 0; 9 if (s[1] >= '1' && s[1

LeetCode91 Decode Ways

题目: A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given an encoded message containing digits, determine the total number of ways to decode it. For example,Given enco

Decode Ways

A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given an encoded message containing digits, determine the total number of ways to decode it. For example,Given encoded

241. Different Ways to Add Parentheses

241. Different Ways to Add Parentheses https://leetcode.com/problems/different-ways-to-add-parentheses/ 思路就是:首先找到以运算符为根节点,分别计算左子串和右子串的所有结果的集合,然后依次进行组合计算.参考博客http://www.cnblogs.com/ganganloveu/p/4681439.html. 自己的思路错了,直接用两边只用了一个整数去接收左右子串的计算值!! #include

[email&#160;protected] [91] Decode Ways (Dynamic Programming)

https://leetcode.com/problems/decode-ways/ A message containing letters from A-Z is being encoded to numbers using the following mapping: 'A' -> 1 'B' -> 2 ... 'Z' -> 26 Given an encoded message containing digits, determine the total number of wa